Applying Approximate Order Dependency to Reduce Indexing Space.
Jirun Dong, Richard Hull:
Applying Approximate Order Dependency to Reduce Indexing Space.
SIGMOD Conference 1982: 119-127@inproceedings{DBLP:conf/sigmod/DongH82,
author = {Jirun Dong and
Richard Hull},
editor = {Mario Schkolnick},
title = {Applying Approximate Order Dependency to Reduce Indexing Space},
booktitle = {Proceedings of the 1982 ACM SIGMOD International Conference on
Management of Data, Orlando, Florida, June 2-4, 1982},
publisher = {ACM Press},
year = {1982},
pages = {119-127},
ee = {http://doi.acm.org/10.1145/582353.582375, db/conf/sigmod/DongH82.html},
crossref = {DBLP:conf/sigmod/82},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
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.
Copyright © 1982 by the ACM,
Inc., used by permission. Permission to make
digital or hard copies is granted provided that
copies are not made or distributed for profit or
direct commercial advantage, and that copies show
this notice on the first page or initial screen of
a display along with the full citation.
Online Version (ACM WWW Account required): Full Text in PDF Format
CDROM Version: Load the CDROM "Volume 1 Issue 2, SIGMOD '75-'92" and ...
DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...
Printed Edition
Mario Schkolnick (Ed.):
Proceedings of the 1982 ACM SIGMOD International Conference on Management of Data, Orlando, Florida, June 2-4, 1982.
ACM Press 1982
Contents
References
- [BBG]
- Catriel Beeri, Philip A. Bernstein, Nathan Goodman:
A Sophisticate's Introduction to Database Normalization Theory.
VLDB 1978: 113-124

- [B]
- Jon Louis Bentley:
Multidimensional Binary Search Trees Used for Associative Searching.
Commun. ACM 18(9): 509-517(1975)

- [C1]
- E. F. Codd:
A Relational Model of Data for Large Shared Data Banks.
Commun. ACM 13(6): 377-387(1970)

- [C2]
- E. F. Codd:
Further Normalization of the Data Base Relational Model.
IBM Research Report, San Jose, California RJ909: (1971)

- [F1]
- Ronald Fagin:
Multivalued Dependencies and a New Normal Form for Relational Databases.
ACM Trans. Database Syst. 2(3): 262-278(1977)

- [F2]
- Ronald Fagin:
Horn Clauses and Database Dependencies (Extended Abstract).
STOC 1980: 123-134

- [FMU]
- Ronald Fagin, Alberto O. Mendelzon, Jeffrey D. Ullman:
A Simplified Universal Relation Assumption and Its Properties.
ACM Trans. Database Syst. 7(3): 343-360(1982)

- [GH]
- Seymour Ginsburg, Richard Hull:
Order Dependency in the Relational Model.
Theor. Comput. Sci. 26: 149-195(1983)

- [M]
- ...
- [K]
- Donald E. Knuth:
The Art of Computer Programming, Volume III: Sorting and Searching.
Addison-Wesley 1973, ISBN 0-201-03803-X

- [PD]
- ...
- [U]
- ...
- [W]
- ...
- [YP]
- Mihalis Yannakakis, Christos H. Papadimitriou:
Algebraic Dependencies (Extended Abstract).
FOCS 1980: 328-332

- [Z]
- ...
Referenced by
- Seymour Ginsburg, Richard Hull:
Sort Sets in the Relational Model.
PODS 1983: 332-339
Last update Fri May 25 08:38:19 2012
CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page