Skip to main content

Querying and Filtering Formatted Files

  • Conference paper
Database Machines

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abiteboul, S., and S. Ginsburg, “Tuple Sequences and Indexes,” Univ. of South. Cal., Technical Report, #83-205

    Google Scholar 

  2. Bancilhon, F., P. Richard and M. Scholl, “On Line Processing of Compacted Relations”, Proc. of VLDB (1982)

    Google Scholar 

  3. Bancilhon & Al, “Verso: A Relational Back End Data Base Machine,” Proc. of the International Workshop on Database Machines, San Diego, (1982)

    Google Scholar 

  4. Codd, E.F., “A Relational Model of Data for Large Shared data banks,” Communications ACM Vol. 13, #6, (1970)

    Article  Google Scholar 

  5. 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. 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. Hopcroft, J.E., and J.D. Ullman, “Formal Languages and Their Relation to Automata”, Reading, Mass.: Addison-Wesley, (1969)

    MATH  Google Scholar 

  8. Information Management System/360 Version 2 General Information Manual, IBM Form #GH20-0765

    Google Scholar 

  9. Stonebraker, M. and J. Kalash, “TIMBER: A Sophisticated Relation Browser,” Proc. VLDB (1982)

    Google Scholar 

  10. Smith, J.M., and D.C.P. Smith, “Database Abstractions: Aggregation and Generalization,” ACM Trans. on Database Sys., (1977)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Abiteboul, S., Cordier, MO., Gamerman, S., Verroust, A. (1983). Querying and Filtering Formatted Files. In: Leilich, HO., Missikoff, M. (eds) Database Machines. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-69419-6_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-69419-6_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12959-2

  • Online ISBN: 978-3-642-69419-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics