Querying and Filtering Formatted Files
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.
Unable to display preview. Download preview PDF.
- [AG]Abiteboul, S., and S. Ginsburg, “Tuple Sequences and Indexes,” Univ. of South. Cal., Technical Report, #83-205Google Scholar
- [BRS]Bancilhon, F., P. Richard and M. Scholl, “On Line Processing of Compacted Relations”, Proc. of VLDB (1982)Google Scholar
- [B+]Bancilhon & Al, “Verso: A Relational Back End Data Base Machine,” Proc. of the International Workshop on Database Machines, San Diego, (1982)Google Scholar
- [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
- [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
- [IMS]Information Management System/360 Version 2 General Information Manual, IBM Form #GH20-0765Google Scholar
- [SK]Stonebraker, M. and J. Kalash, “TIMBER: A Sophisticated Relation Browser,” Proc. VLDB (1982)Google Scholar
- [SS]Smith, J.M., and D.C.P. Smith, “Database Abstractions: Aggregation and Generalization,” ACM Trans. on Database Sys., (1977)Google Scholar