Use of graph-theoretic models for optimal relational database accesses to perform join
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
Heuristics for Join Processing Using Nonclustered Indexes
IEEE Transactions on Software Engineering
Introduction to algorithms
Join processing in relational databases
ACM Computing Surveys (CSUR)
Query evaluation techniques for large databases
ACM Computing Surveys (CSUR)
Efficient processing of spatial joins using R-trees
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Multi-step processing of spatial joins
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Spatial joins using seeded trees
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
An Analysis of Spectral Envelope Reduction via Quadratic Assignment Problems
SIAM Journal on Matrix Analysis and Applications
Multilevel hypergraph partitioning: application in VLSI domain
DAC '97 Proceedings of the 34th annual Design Automation Conference
Multilevel k-way partitioning scheme for irregular graphs
Journal of Parallel and Distributed Computing
Multilevel hypergraph partitioning: applications in VLSI domain
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Operating system support for database management
Communications of the ACM
An anomaly in space-time characteristics of certain programs running in a paging machine
Communications of the ACM
Building the Data Warehouse
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
Optimal Secondary Storage Access Sequence for Performing Relational Join
IEEE Transactions on Knowledge and Data Engineering
CCAM: A Connectivity-Clustered Access Method for Networks and Network Computations
IEEE Transactions on Knowledge and Data Engineering
Efficient Scheduling of Page Access in Index-Based Join Processing
IEEE Transactions on Knowledge and Data Engineering
Spatial Databases-Accomplishments and Research Needs
IEEE Transactions on Knowledge and Data Engineering
Scheduling of Page Fetches in Join Operations Using Bc-Trees
Proceedings of the Fourth International Conference on Data Engineering
Proceedings of the Seventh International Conference on Data Engineering
A New Algorithm for Computing Joins with Grid Files
Proceedings of the Ninth International Conference on Data Engineering
Efficient Computation of Spatial Joins
Proceedings of the Ninth International Conference on Data Engineering
Parallel Multilevel Graph Partitioning
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
A Mechanism for Managing the Buffer Pool in a Relational Database System Using the Hot Set Model
VLDB '82 Proceedings of the 8th International Conference on Very Large Data Bases
SSD '93 Proceedings of the Third International Symposium on Advances in Spatial Databases
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
Graphs and Hypergraphs
Multi-level direct K-way hypergraph partitioning with multiple constraints and fixed vertices
Journal of Parallel and Distributed Computing
Should SDBMS support a join index?: a case study from CrimeStat
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Join-queries between two spatial datasets indexed by a single R*-tree
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Replicated partitioning for undirected hypergraphs
Journal of Parallel and Distributed Computing
Static and incremental selection of multi-table indexes for very large join queries
ADBIS'12 Proceedings of the 16th East European conference on Advances in Databases and Information Systems
Accelerating spatial join operations using bit-indices
ADC '11 Proceedings of the Twenty-Second Australasian Database Conference - Volume 115
| Hi-index | 0.01 |
A join-index is a data structure used for processing join queries in databases. Join-indices use precomputation techniques to speed up online query processing and are useful for data sets which are updated infrequently. The I/O cost of join computation using a join-index with limited buffer space depends primarily on the page-access sequence used to fetch the pages of the base relations. Given a join-index, we introduce a suite of methods based on clustering to compute the joins. We derive upper bounds on the length of the page-access sequences. Experimental results with Sequoia 2000 data sets show that the clustering method outperforms existing methods based on sorting and online-clustering heuristics.