Database Systems: The Complete Book

By Hector Garcia-Molina, Jeffrey D. Ullman, Jennifer Widom. 2001

1,495 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/0ec2a62edef364f4bef1e1b265d3d7869bb4444a

How researchers see this paper

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

Citations in the corpus

Executing SPARQL Queries over the Web of Linked Data (2009, background): “A well established approach to realize query plans is pipelining in which each solution produced by one operation is passed directly to the operation that uses it [6].”
Executing SQL over encrypted data in the database-service-provider model (2002, methodology): “In addition, we use R and T to denote two relations, and use the operator notations in [4].”
Digital ecosystems in the clouds: Towards community cloud computing (2009, background): “Such varying requirements call for a combination of approaches, including distributed storage [95], distributed databases [96] and key-value stores [26].”
Towards Scaling Blockchain Systems via Sharding (2018, unknown): “ence committee R is the coordinator, and tx-committees are the participants. The state machine of the reference committee shown in Figure 6 is identical to that of the coordinator in the original 2PC [24]. Figure 7 illustrates the correspondence between our protocol and the original 2PC protocol. Si”
b-Bit Minwise Hashing for Estimating Three-Way Similarities (2010, background): “Before conducting intersections, a critical task is to (quickly) estimate the sizes of the intermediate results to plan the optimal intersection order [20, 8, 25].”
Comprehensive structural classification of ligand-binding motifs in proteins. (2008, methodology): “By combining ideas from geometric hashing (Wolfson & Rigoutsos, 1997) and relational database searching (Garcia-Molina et al., 2002), this method can efficiently find structurally and chemically similar local protein structures in a database and produce alignments at atomic resolution independent…”
Keyword proximity search on XML graphs (2003, unknown): “This XML fragment contains four results: N1 : p1 ← l1 → pa3 → pa1, N2 : p1 ← l2 → pa3 → pa2, N3 : p1 ← l2 → pa3 → pa1, N4 : p1 ← l1 → pa3 → pa2 The above results contain a form of redundancy similar to multivalued dependencies [20]: we can infer N3 and N4 from N1 and N2.”
Introduction to the special topic section on mining Web resources for enhancing information retrieval (2007, methodology): “We can extend the complete set of inference rules for reasoning with database FDs, known as Armstrong’s axioms (reflexivity, augmentation, and transitivity) (Garcia-Molina et al., 2002), from relational database theory to reason about web FDs as well, by focusing on relationships between values rath”
Translating Questions to SQL Queries with Generative Parsers Discriminatively Reranked (2012, background): “…SQL query above is the same as that of the relational expression: πCOLU MN σCON DI T ION (TABLE) (2) It is worth noting that while relational algebra formally applies to sets of tuples (i.e. relations), in a DBMS relations are bags so it may contain duplicate tuples (Garcia-Molina et al., 2008).”
Rudiments of rough sets (2007, background): “e can compare data tables corresponding to information systems with relations in relational databases [58].”