Tuple sequences and indexes

  • Serge Abiteboul
  • Seymour Ginsburg
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 172)


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.


Functional Dependency Inference Rule Index Satisfaction Minimal Index Index Dependency 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [ACGV]
    S. Abiteboul, M-O Cordier, S. Gamerman and A. Verroust, Querying and Filtering Formated Files, Proceedings of Intern. Conf. on Database Machine (1983).Google Scholar
  2. [AG]
    S. Abiteboul and S. Ginsburg, Tuple Sequences and Indexes, University of Southern California, Technical Report #83-205.Google Scholar
  3. [Ar]
    W. W. Armstrong, Dependency Structure of Database Relationships, Proceedings IFIP74, North-Holland (1974), p. 580–583.Google Scholar
  4. [AS]
    M. M. Astrahan et al., System R: A Relational Approach to Data Base Management, ACM TODS, Vol. 1 (1976), p. 97–137.Google Scholar
  5. [BFH]
    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.Google Scholar
  6. [DKG]
    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.Google Scholar
  7. [K]
    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.Google Scholar
  8. [Sh]
    D.W. Shipman, The Functional Data Model and the Data Language DAPLEX, ACM TODS, Vol. 6 (1981), p. 140–173.Google Scholar
  9. [SM]
    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.Google Scholar
  10. [S]
    M. Stonebraker et al., The design and implementation of INGRES, ACM TODS, Vol. 1 (1976), p. 189–222.Google Scholar
  11. [SK]
    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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Serge Abiteboul
    • 1
  • Seymour Ginsburg
    • 2
  1. 1.Institut National de Recherche en Informatique et AutomatiqueRocquencourtFrance
  2. 2.University of Southern CaliforniaLos Angeles

Personalised recommendations