Abstract
The concept of tuple sequence is introduced in order to investigate structure connected with relational model implementation. Well-known problems like decomposition and duplicates are addressed for tuple sequences. The lexicographical ordering of tuple sequences is studied via the notion of index (dependency). Certain properties of index families are shown, and two algorithmiques questions related to indexes considered. Also, a sound and complete set of inference rules for indexes is exhibited. Finally, indexes and functional dependencies in combination are studied.
This work was supported in part by the National Science Foundation under grant MCS-7925004.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Abiteboul, M-O Cordier, S. Gamerman and A. Verroust, Querying and Filtering Formated Files, Proceedings of Intern. Conf. on Database Machine (1983).
S. Abiteboul and S. Ginsburg, Tuple Sequences and Indexes, University of Southern California, Technical Report #83-205.
W. W. Armstrong, Dependency Structure of Database Relationships, Proceedings IFIP74, North-Holland (1974), p. 580–583.
M. M. Astrahan et al., System R: A Relational Approach to Data Base Management, ACM TODS, Vol. 1 (1976), p. 97–137.
C. Beeri, R. Fagin and J. H. Howard, A Complete Axiomatization for Functional and Multivalued Dependencies in Database Relations, ACM SIGMOD International Symposium on Management of Data (1977), p. 47–61.
U. Dayal, N. Goodman and R. Katz, An Extended Relational Algebra with Control over Duplicate Elimination, Proceedings of the ACM Symposium on Principles of Database Systems (1982), p. 117–123.
R. M. Karp, Reducibility among Combinatorial Problems, in Complexity of Computer Applications, ed. R. E. Miller and J. W. Thatcher, Plenum Press, New York, 1972, p. 85–104.
D.W. Shipman, The Functional Data Model and the Data Language DAPLEX, ACM TODS, Vol. 6 (1981), p. 140–173.
L. J. Stockmeyer and A. E. Meyer, Word Problems Requiring Exponential Time, Proceedings of the Fifth Annual ACM Symposium on Theory of Computing (1973), p. 1–9.
M. Stonebraker et al., The design and implementation of INGRES, ACM TODS, Vol. 1 (1976), p. 189–222.
M. Stonebraker and J. Kalash, Timber: A Sophisticated Relation Browser, Proceedings of the Eighth International Conference on Very Large Data Bases, Mexico City (1982), p. 1–10.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abiteboul, S., Ginsburg, S. (1984). Tuple sequences and indexes. In: Paredaens, J. (eds) Automata, Languages and Programming. ICALP 1984. Lecture Notes in Computer Science, vol 172. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-13345-3_3
Download citation
DOI: https://doi.org/10.1007/3-540-13345-3_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13345-2
Online ISBN: 978-3-540-38886-9
eBook Packages: Springer Book Archive