An adaptive mixed relation decomposition algorithm for conjunctive retrieval queries

DOI10.1016/0020-0255(91)90057-2zbMath0714.68027OpenAlexW1983604627MaRDI QIDQ751264

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

zbMATH Keywords

adaptive relation decompositionconjunctive retrieval queries

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Information storage and retrieval of data (68P20)

Cites Work

• 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
• Query processing in a system for distributed databases (SDD-1)
• A unifying model of physical databases
• Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
• Approximating block accesses in database organizations
• Database partitioning in a cluster of processors
• Some distance properties of latent root and vector methods used in multivariate analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An adaptive mixed relation decomposition algorithm for conjunctive retrieval queries