Querying and Filtering Formatted Files

  • S. Abiteboul
  • M.-O. Cordier
  • S. Gamerman
  • A. Verroust
Conference paper


More and more database machines are using the so-called technique of “filtering on the fly” [BRS]. The underlying idea is the fast processing of sequential files. The main theme of the present paper is to propose a simple model (formatted file) to represent information of (possibly) sequential nature, and simple query languages to access this information. It turns out that our formalism highlights the close relationship between file filtering and formal language translation. This leads to the other theme of the paper, that is the presentation of some filters and a description of their respective powers.


Regular Expression Finite State Machine Music Class Query Format Simple Query 
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. [AG]
    Abiteboul, S., and S. Ginsburg, “Tuple Sequences and Indexes,” Univ. of South. Cal., Technical Report, #83-205Google Scholar
  2. [BRS]
    Bancilhon, F., P. Richard and M. Scholl, “On Line Processing of Compacted Relations”, Proc. of VLDB (1982)Google Scholar
  3. [B+]
    Bancilhon & Al, “Verso: A Relational Back End Data Base Machine,” Proc. of the International Workshop on Database Machines, San Diego, (1982)Google Scholar
  4. [C]
    Codd, E.F., “A Relational Model of Data for Large Shared data banks,” Communications ACM Vol. 13, #6, (1970)CrossRefGoogle Scholar
  5. [DKG]
    Dayal, U., N. Goodman and R.H. Katz, “An Extended Relational Algebra with Control over Duplicate Elimination,” Proc. of ACM Symp. on Princ. of Databases Sys., (1982)Google Scholar
  6. [HY]
    Hull, R. and C.K. Yap, “The Format Model: A Theory of Database Organization,” Proc. of ACM Symp. on Princ. of Databases Sys., (1982)Google Scholar
  7. [HU]
    Hopcroft, J.E., and J.D. Ullman, “Formal Languages and Their Relation to Automata”, Reading, Mass.: Addison-Wesley, (1969)MATHGoogle Scholar
  8. [IMS]
    Information Management System/360 Version 2 General Information Manual, IBM Form #GH20-0765Google Scholar
  9. [SK]
    Stonebraker, M. and J. Kalash, “TIMBER: A Sophisticated Relation Browser,” Proc. VLDB (1982)Google Scholar
  10. [SS]
    Smith, J.M., and D.C.P. Smith, “Database Abstractions: Aggregation and Generalization,” ACM Trans. on Database Sys., (1977)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1983

Authors and Affiliations

  • S. Abiteboul
    • 1
  • M.-O. Cordier
    • 2
  • S. Gamerman
    • 1
    • 2
  • A. Verroust
    • 1
  1. 1.Institut National de Recherche en Informatique et AutomatiqueRocquencourtFrance
  2. 2.Laboratoire de Recherche en InformatiqueUniversité de Paris SudOrsayFrance

Personalised recommendations