An algorithm for handling many relational calculus queries efficiently.
From MaRDI portal
Publication:1872707
DOI10.1006/jcss.2002.1848zbMath1059.68026OpenAlexW1996327385MaRDI QIDQ1872707
Publication date: 14 May 2003
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/90255a8ff69931940512995895563ccce31a9336
Related Items (4)
Unnamed Item ⋮ Generic multiset programming with discrimination-based joins and symbolic Cartesian products ⋮ 2003 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquim '03 ⋮ Intersection joins under updates
Cites Work
- Unnamed Item
- Unnamed Item
- Multidimensional divide-and-conquer
- The design of dynamic data structures
- Optimization of distributed tree queries
- Dynamic fractional cascading
- Fractional cascading. I: A data structuring technique
- Mechanical translation of set theoretic problem specifications into efficient RAM code - a case study
- Lower bounds for the addition-subtraction operations in orthogonal range queries and related problems
- Efficient worst-case data structures for range searching
- Two general methods for dynamizing decomposable searching problems
- Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees
- On the complexity of database queries
- Surpassing the information theoretic bound with fusion trees
- A data structure for dynamic range queries
- Applications of range query theory to relational data base join and selection operations
- On the Desirability of Acyclic Database Schemes
- Degrees of acyclicity for hypergraphs and relational database schemes
- Syntactic Characterization of Tree Database Schemas
- Lower bounds for orthogonal range searching: I. The reporting case
- New Data Structures for Orthogonal Range Queries
- On the Complexity of Maintaining Partial Sums
- Batched dynamic solutions to decomposable searching problems
- Filtering Search: A New Approach to Query-Answering
- Adding range restriction capability to dynamic data structures
- Efficient data structures for range searching on a grid
- Lower Bounds on the Complexity of Some Optimal Data Structures
- Using Semi-Joins to Solve Relational Queries
- Decomposable searching problems I. Static-to-dynamic transformation
- A Lower Bound on the Complexity of Orthogonal Range Queries
- Power of Natural Semijoins
- On the Equivalence of Database Models
- A new normal form for the design of relational database schemata
- Tree queries
- Multidimensional binary search trees used for associative searching
- Optimal sample cost residues for differential database batch query problems
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
- Examining Computational Geometry, Van Emde Boas Trees, and Hashing from the Perspective of the Fusion Tree
This page was built for publication: An algorithm for handling many relational calculus queries efficiently.
