This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Relational Approach to Querying Data Streams
December 1990 (vol. 2 no. 4)
pp. 401-409

Data streams are long, relatively unstructured sequences of characters that contain information such as electronic mail or a tape backup of various documents and reports created in an office. A conceptual framework is presented, using relational algebra and relational databases, within which data streams may be queried. As information is extracted from the data streams, it is put into a relational database that may be queried in the usual manner. The database schema evolves as the user's knowledge of the content of the data stream changes. Operators are defined in terms of relational algebra that can be used to extract data from a specially defined relation that contains all or part of the data stream. This approach to querying data streams permits the integration of unstructured data with structured data. The operators defined extend the functionality of relational algebra in much the same way that the join does relative to the basic operators select, project, union, difference, and Cartesian product.

[1] L. M. Bernstein and R. E. Williamson, "Testing of a natural language retrieval system for a full text knowledge base,"J. Amer. Soc. Inform. Sci., vol. 35, no. 4, pp. 235-247, 1984.
[2] R. G. Crawford, "The relational model in information retrieval,"J. Amer. Soc. Inform. Sci., vol. 32, no. 1, pp. 51-64, 1981.
[3] R. G. Crawford, "Bibliographic retrieval using a relational database," inProc. 11th Annu. CAIS Conf., Halifax, N.S., Canada, May 24-26, 1983, pp. 108-116.
[4] R. G. Crawford and I.A. MacLeod, "Modular indexing in a relationally based document retrieval system,"Can. J. Inform. Sci., vol. 6, pp. 67-75, 1981.
[5] R. Fagin, A. O. Mendelzon, and J. D. Ullman, "A simplified universal relation assumption and its properties,"ACM Trans. Database Syst., vol. 7, no. 3, pp. 343-360, Sept. 1982.
[6] C. Faloutsos, "Access methods for text,"ACM Comput. Surveys, vol. 17, pp. 49-74, Mar. 1985.
[7] J. L. Kolodner, "Indexing and retrieval strategies for natural language fact retrieval,"ACM Trans. Database Syst., vol. 8, no. 3, pp. 434-464, Sept. 1983.
[8] H. F. Korth, G. M. Kuper, J. Feigenbaum, A. V. Gelder, and J. D. Ullman, "System/U: A database system based on the universal relation assumption,"ACM Trans. Database Syst., vol. 9, pp. 331-347, Sept. 1984.
[9] D. Maier, J. Ullman, and M. Vardi, "On the foundations of the universal-relation model,"ACM Trans. Database Syst., pp. 283-308, Sept. 1984.
[10] G. Ozsoyoglu, Z. M. Ozsoyoglu, and V. Matos, "Extending relational algebra and relational calculus with set-valued attributes and aggregate functions,"ACM Trans. Database Syst., vol. 12, no. 4, pp. 566-592, Dec. 1987.
[11] G. Salton and M. J. McGill,Introduction to Modern Information Retrieval(Computer Series). New York: McGraw-Hill, 1983.
[12] [I8] M. Stonebraker, H. Stettner, J. Kalash, A. Guttman, and W. Lynn, "Document processing in a relational database system,"ACM Trans. Ofice Inform. Syst., vol. 1. pp. 143-158, 1983.

Index Terms:
data stream querying; unstructured sequences; electronic mail; tape backup; office; conceptual framework; relational algebra; relational databases; database schema; unstructured data; structured data; database theory; information retrieval systems; relational databases
Citation:
C.S. Hartzman, C.R. Watters, "A Relational Approach to Querying Data Streams," IEEE Transactions on Knowledge and Data Engineering, vol. 2, no. 4, pp. 401-409, Dec. 1990, doi:10.1109/69.63252
Usage of this product signifies your acceptance of the Terms of Use.