Applying approximate order dependency to reduce indexing space

Authors:
Jirun Dong;Richard Hull
Affiliations:
Shandong University Jinan, Shandong People's Republic of China;University of California at Los Angeles, Los Angeles, California
Venue:
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
Year:
1982

Citing 8
Cited 7

The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Multivalued dependencies and a new normal form for relational databases

ACM Transactions on Database Systems (TODS)
Multidimensional binary search trees used for associative searching

Communications of the ACM
A relational model of data for large shared data banks

Communications of the ACM
Principles of Database Systems

Principles of Database Systems
Database Design

Database Design
Horn clauses and database dependencies (Extended Abstract)

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Analysis and design of relational schemata for database systems.

Analysis and design of relational schemata for database systems.

Sort sets in the relational model

Journal of the ACM (JACM)
Sort sets in the relational model

PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Sequential dependencies

Proceedings of the VLDB Endowment
Differential dependencies: Reasoning and discovery

ACM Transactions on Database Systems (TODS)
SILT: a memory-efficient, high-performance key-value store

SOSP '11 Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles
Fundamentals of order dependencies

Proceedings of the VLDB Endowment
Expressiveness and complexity of order dependencies

Proceedings of the VLDB Endowment

Quantified Score

Hi-index	0.00

Visualization

Abstract

The recently introduced notion of order dependency in the relational model is generalized to include situations where order dependency is satisfied in an approximate way. Two fundamental types of approximate satisfaction are distinguished and analyzed. It is shown for both types that such approximate satisfaction of order dependencies can be applied to substantially reduce indexing space without significantly increasing access time.