Join processing in database systems with large main memories
ACM Transactions on Database Systems (TODS)
R* optimizer validation and performance evaluation for local queries
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
ACM Transactions on Database Systems (TODS)
A data model and query language for EXODUS
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Index scans using a finite LRU buffer: a validated I/O model
ACM Transactions on Database Systems (TODS)
The O2 object manager: an overview
VLDB '89 Proceedings of the 15th international conference on Very large data bases
A model of queries for object-oriented databases
VLDB '89 Proceedings of the 15th international conference on Very large data bases
The EXODUS extensible DBMS project: an overview
Readings in object-oriented database systems
The functional data model and the data languages DAPLEX
ACM Transactions on Database Systems (TODS)
Differential files: their application to the maintenance of large databases
ACM Transactions on Database Systems (TODS)
Approximating block accesses in database organizations
Communications of the ACM
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
IEEE Transactions on Knowledge and Data Engineering
Starburst Mid-Flight: As the Dust Clears
IEEE Transactions on Knowledge and Data Engineering
Storage and Access Structures to Support a Semantic Data Model
VLDB '82 Proceedings of the 8th International Conference on Very Large Data Bases
Efficient assembly for complex objects
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Join processing in relational databases
ACM Computing Surveys (CSUR)
A transformation-based approach to optimizing loops in database programming languages
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Query evaluation techniques for large databases
ACM Computing Surveys (CSUR)
Experiences building the open OODB query optimizer
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Efficient maintenance of rule-derived data through join pattern indexing
CIKM '93 Proceedings of the second international conference on Information and knowledge management
Extending SQL-92 for OODB access: design and implementation experience
Proceedings of the tenth annual conference on Object-oriented programming systems, languages, and applications
OFL: a functional execution model for object query languages
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
&mgr;Database: parallelism in a memory-mapped environment (research summary)
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Benchmarking queries over trees: learning the hard truth the hard way
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Estimating nested selectivity in object-oriented databases
Proceedings of the ninth international conference on Information and knowledge management
The state of the art in distributed query processing
ACM Computing Surveys (CSUR)
Journal of Computer Science and Technology
A Framework for Join Pattern Indexing in Intelligent Database Systems
IEEE Transactions on Knowledge and Data Engineering
Performance Analysis of Parallel Query Processing Algorithms for Object-Oriented Databases
IEEE Transactions on Knowledge and Data Engineering
Criss-Cross Hash Joins: Design and Analysis
IEEE Transactions on Knowledge and Data Engineering
Validated Cost Models for Parallel OQL Query Processing
OOIS '02 Proceedings of the 8th International Conference on Object-Oriented. Information Systems
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Efficient Main Memory Data Management Using the DBGraph Storage Model
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
An Incremental Join Attachment for Starburst
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Set Containment Joins: The Good, The Bad and The Ugly
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
From Nested-Loop to Join Queries in OODB
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Evaluation of Main Memory Join Algorithms for Joins with Set Comparison Join Predicates
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
SSDBM '97 Proceedings of the Ninth International Conference on Scientific and Statistical Database Management
An Experimental Performance Evaluation of Join Algorithms for Parallel Object Databases
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
The VLDB Journal — The International Journal on Very Large Data Bases
The VLDB Journal — The International Journal on Very Large Data Bases
OPT++ : an object-oriented implementation for extensible database query optimization
The VLDB Journal — The International Journal on Very Large Data Bases
Sing the truth about ad hoc join costs
The VLDB Journal — The International Journal on Very Large Data Bases
Efficiently publishing relational data as XML documents
The VLDB Journal — The International Journal on Very Large Data Bases
The Design, Implementation and Evaluation of an ODMG Compliant, Parallel Object Database Server
Distributed and Parallel Databases
Integrating document and data retrieval based on XML
The VLDB Journal — The International Journal on Very Large Data Bases
New algorithms for join and grouping operations
Computer Science - Research and Development
Hi-index | 0.00 |
In this paper we describe three pointer-based join algorithms that are simple variants of the nested-loops, sort-merge, and hybrid-hash join algorithms used in relational database systems. Each join algorithm is described and an analysis is carried out to compare the performance of the pointer-based algorithms to their standard, non-pointer-based counterparts. The results of the analysis show that the pointer-based algorithms can provide significant performance gains in many situations. The results also show that the pointer-based nested-loops join algorithm, which is perhaps the most natural pointer-based join algorithm to consider using in an object-oriented database system, performs quite poorly on most medium to large joins.