An adaptive mixed relation decomposition algorithm for conjunctive retrieval queries
From MaRDI portal
(Redirected from Publication:751264)
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
- scientific article; zbMATH DE number 3890770 (Why is no real title available?)
- scientific article; zbMATH DE number 3904003 (Why is no real title available?)
- scientific article; zbMATH DE number 3755826 (Why is no real title available?)
- scientific article; zbMATH DE number 3513332 (Why is no real title available?)
- A Methodology for Structured Database Decomposition
- A heuristic file reorganization algorithm based on record clustering
- A solution method for the non-additive resource allocation problem in distributed system design
- A unifying model of physical databases
- Approximating block accesses in database organizations
- Database partitioning in a cluster of processors
- Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
- Query processing in a system for distributed databases (SDD-1)
- Some distance properties of latent root and vector methods used in multivariate analysis
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)
