Complex database queries require the use of memory-intensive operators like sort and hashjoin. Those operators need memory, also referred to as SQL memory, to process their input ...
Supporting legacy applications when the database schema evolves represents a long-standing challenge of practical and theoretical importance. Recent work has produced algorithms a...
Carlo Curino, Hyun Jin Moon, Alin Deutsch, Carlo Z...
Twig queries represent the building blocks of declarative query languages over XML data. A twig query describes a complex traversal of the document graph and generates a set of el...
Neoklis Polyzotis, Minos N. Garofalakis, Yannis E....
A key step in the optimization of declarative queries over XML data is estimating the selectivity of path expressions, i.e., the number of elements reached by a specific navigatio...
Natasha Drukh, Neoklis Polyzotis, Minos N. Garofal...
In a variety of applications ranging from optimizing queries on alphanumeric attributes to providing approximate counts of documents containing several query terms, there is an in...
Zhiyuan Chen, Flip Korn, Nick Koudas, S. Muthukris...