Database partitioning in a cluster of processors
ACM Transactions on Database Systems (TODS)
ACM Computing Surveys (CSUR)
ACM Transactions on Database Systems (TODS)
Journal of Systems and Software
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
A normal form for relational databases that is based on domains and keys
ACM Transactions on Database Systems (TODS)
Query processing in a system for distributed databases (SDD-1)
ACM Transactions on Database Systems (TODS)
A unifying model of physical databases
ACM Transactions on Database Systems (TODS)
Implementing a relational database by means of specialzed hardware
ACM Transactions on Database Systems (TODS)
Optimization of query evaluation algorithms
ACM Transactions on Database Systems (TODS)
Implementing a generalized access path structure for a relational database system
ACM Transactions on Database Systems (TODS)
Using Semi-Joins to Solve Relational Queries
Journal of the ACM (JACM)
Use of composite index in DDBMS
CSC '86 Proceedings of the 1986 ACM fourteenth annual conference on Computer science
ACM Computing Surveys (CSUR)
Data Structures for Range Searching
ACM Computing Surveys (CSUR)
A history and evaluation of System R
Communications of the ACM
Approximating block accesses in database organizations
Communications of the ACM
A relational model of data for large shared data banks
Communications of the ACM
LSL: a Link and Selector Language
SIGMOD '76 Proceedings of the 1976 ACM SIGMOD international conference on Management of data
An Introduction to Database Systems
An Introduction to Database Systems
A domain based internal schema for relational database machines
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
Query processing strategies in the PASCAL/R relational database management system
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
Implementation techniques for main memory database systems
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Hashing Methods and Relational Algebra Operations
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
SEQUEL: A structured English query language
SIGFIDET '74 Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control
Join processing in relational databases
ACM Computing Surveys (CSUR)
Efficient maintenance of rule-derived data through join pattern indexing
CIKM '93 Proceedings of the second international conference on Information and knowledge management
Join processing and domain indices
CSC '91 Proceedings of the 19th annual conference on Computer Science
A Framework for Join Pattern Indexing in Intelligent Database Systems
IEEE Transactions on Knowledge and Data Engineering
Efficient Scheduling of Page Access in Index-Based Join Processing
IEEE Transactions on Knowledge and Data Engineering
Criss-Cross Hash Joins: Design and Analysis
IEEE Transactions on Knowledge and Data Engineering
A New Algorithm for Page Access Sequencing in Join Processing
ADBIS-DASFAA '00 Proceedings of the East-European Conference on Advances in Databases and Information Systems Held Jointly with International Conference on Database Systems for Advanced Applications: Current Issues in Databases and Information Systems
Page Access Sequencing in Join Processing with Limited Buffer Space
DEXA '01 Proceedings of the 12th International Conference on Database and Expert Systems Applications
A matching-based algorithm for page access sequencing in join processing
Journal of Systems and Software
High volumes of event stream indexing and efficient multi-keyword searching for cloud monitoring
Future Generation Computer Systems
| Hi-index | 0.00 |
The use of a composite index known as the B/sub c/-tree is presented; it is based on the concept of the B/sup +/-tree and serves the dual purpose of an attribute and join index and indirectly implements the link sets. The leaf node of the B/sub c/-tree incorporates in each leaf node a reference to all tuples in the database that share common data values of a shared domain. In addition to improving the performance of the join and selection operations, the composite index facilitate the enforcement of structural integrity constraints. The author also presents the results of simulations that compare the performance of this approach with the simple join technique. The proposed approach, in the case of the simulated database, is seen to provide better performance for an average domain value size of greater than between 2 and 4 bytes.