Database System Implementation

461 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

YARS2: A Federated Repository for Querying Graph Structured Data from the Web (2007, methodology): “For implementing a complete index on quadruples, we consider three index structures: B-tree, hash table, and sparse index[11].”
Efficient Subgraph Matching on Billion Node Graphs (2012, methodology): “We apply sample-based join cost estimation method and cost-based join order selection method [14] to select the join order on each computer.”
Efficient keyword search for smallest LCAs in XML databases (2005, methodology): “Given a keyword and a Dewey number , it takes a single range scan operation [11] to find the right and left mat ch of in the keyword list of .”
Size Bounds and Query Plans for Relational Joins (2008, background): “While these questions have been intensely studied in practice, and numerous heuristics and efﬁciently solvable special cases are known (see, e.g., [3, 9, 7]), the very basic theoretical results we present here and their consequences apparently have not been noticed so far.”