Query evaluation techniques for large databases

G Graefe - ACM Computing Surveys (CSUR), 1993 - dl.acm.org
Database management systems will continue to manage large data volumes. Thus, efficient
algorithms for accessing and manipulating large sets and sequences will be required to …

[PDF][PDF] Query optimization

YE Ioannidis - ACM Computing Surveys (CSUR), 1996 - dl.acm.org
Given a query, there are many access plans that a database management system (DBMS)
can follow to process it and produce its answer. All plans are equivalent in terms of their final …

Learning to optimize join queries with deep reinforcement learning

S Krishnan, Z Yang, K Goldberg, J Hellerstein… - arXiv preprint arXiv …, 2018 - arxiv.org
Exhaustive enumeration of all possible join orders is often avoided, and most optimizers
leverage heuristics to prune the search space. The design and implementation of heuristics …

[图书][B] Database management systems

R Ramakrishnan, J Gehrke - 2002 - dl.acm.org
Database Management Systems provides comprehensive and up-to-date coverage of the
fundamentals of database systems. Coherent explanations and practical examples have …

TinyDB: an acquisitional query processing system for sensor networks

SR Madden, MJ Franklin, JM Hellerstein… - ACM Transactions on …, 2005 - dl.acm.org
We discuss the design of an acquisitional query processor for data collection in sensor
networks. Acquisitional issues are those that pertain to where, when, and how often data is …

Eddies: Continuously adaptive query processing

R Avnur, JM Hellerstein - Proceedings of the 2000 ACM SIGMOD …, 2000 - dl.acm.org
In large federated and shared-nothing databases, resources can exhibit widely fluctuating
characteristics. Assumptions made at the time a query is submitted will rarely hold …

Heuristic and randomized optimization for the join ordering problem

M Steinbrunn, G Moerkotte, A Kemper - The VLDB journal, 1997 - Springer
Recent developments in database technology, such as deductive database systems, have
given rise to the demand for new, cost-effective optimization techniques for join expressions …

The design of an acquisitional query processor for sensor networks

S Madden, MJ Franklin, JM Hellerstein… - Proceedings of the 2003 …, 2003 - dl.acm.org
We discuss the design of an acquisitional query processor for data collection in sensor
networks. Acquisitional issues are those that pertain to where, when, and how often data is …

Finding regular simple paths in graph databases

AO Mendelzon, PT Wood - SIAM Journal on Computing, 1995 - SIAM
We consider the following problem: given a labelled directed graph G and a regular
expression R, find all pairs of nodes connected by a simple path such that the concatenation …

Adaptive query processing

A Deshpande, Z Ives, V Raman - Foundations and Trends® …, 2007 - nowpublishers.com
As the data management field has diversified to consider settings in which queries are
increasingly complex, statistics are less available, or data is stored remotely, there has been …