The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
System R: relational approach to database management
ACM Transactions on Database Systems (TODS)
Relational Data-Base Management Systems
ACM Computing Surveys (CSUR)
Implementation of a structured English query language
Communications of the ACM
A relational model of data for large shared data banks
Communications of the ACM
SIGMOD '75 Proceedings of the 1975 ACM SIGMOD international conference on Management of data
A multi-level relational system
AFIPS '75 Proceedings of the May 19-22, 1975, national computer conference and exposition
INGRES: a relational data base system
AFIPS '75 Proceedings of the May 19-22, 1975, national computer conference and exposition
Early Separation of Filter and Refinement Steps in Spatial Query Optimization
DASFAA '99 Proceedings of the Sixth International Conference on Database Systems for Advanced Applications
Performance Analysis of Database Systems
Performance Evaluation: Origins and Directions
Page Access Sequencing in Join Processing with Limited Buffer Space
DEXA '01 Proceedings of the 12th International Conference on Database and Expert Systems Applications
Constructing Inter-relational Rules for Semantic Query Optimisation
DEXA '02 Proceedings of the 13th International Conference on Database and Expert Systems Applications
Hash-Based Symmetric Data Structure and Join Algorithm for OLAP Applications
IDEAS '99 Proceedings of the 1999 International Symposium on Database Engineering & Applications
Sort vs. Hash revisited: fast join implementation on modern multi-core CPUs
Proceedings of the VLDB Endowment
Optimizing relational algebra operations using generic equivalence discriminators and lazy products
Proceedings of the 2010 ACM SIGPLAN workshop on Partial evaluation and program manipulation
Toward intersection filter-based optimization for joins in MapReduce
Proceedings of the 2nd International Workshop on Cloud Intelligence
An overview of recent data base research
ACM SIGMIS Database
| Hi-index | 0.00 |
A model of storage and access to a relational data base is presented. Using this model, four techniques for evaluating a general relational query that involves the operations of projection, restriction, and join are compared on the basis of cost of accessing secondary storage. The techniques are compared numerically and analytically for various values of important parameters. Results indicate that physical clustering of logically adjacent items is a critical performance parameter. In the absence of such clustering, methods that depend on sorting the records themselves seem to be the algorithm of choice.