An adaptive mixed relation decomposition algorithm for conjunctive retrieval queries
From MaRDI portal
Publication:751264
DOI10.1016/0020-0255(91)90057-2zbMATH Open0714.68027OpenAlexW1983604627MaRDI QIDQ751264FDOQ751264
Authors: Wojtek Kozaczynski 
Publication date: 1991
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0255(91)90057-2
Recommendations
- An efficient algorithm for processing multi-relation queries in relational databases
- Containment of conjunctive queries on annotated relations
- scientific article; zbMATH DE number 3949759
- Conjunctive query containment revisited
- Conjunctive query evaluation by search-tree revisited
- Efficient Approximations of Conjunctive Queries
- scientific article; zbMATH DE number 3974350
- scientific article; zbMATH DE number 1951561
- Database Theory - ICDT 2005
Cites Work
- Some distance properties of latent root and vector methods used in multivariate analysis
- Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
- Title not available (Why is that?)
- Database partitioning in a cluster of processors
- Title not available (Why is that?)
- Approximating block accesses in database organizations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Query processing in a system for distributed databases (SDD-1)
- A solution method for the non-additive resource allocation problem in distributed system design
- A heuristic file reorganization algorithm based on record clustering
- A Methodology for Structured Database Decomposition
- A unifying model of physical databases
Cited In (3)
This page was built for publication: An adaptive mixed relation decomposition algorithm for conjunctive retrieval queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q751264)
