This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Atlas: A Nested Relational Database System for Text Applications
June 1995 (vol. 7 no. 3)
pp. 454-470

Abstract—Advanced database applications require facilities such as text indexing, image storage, and the ability to store data with a complex structure. However, these facilities are not usually included in traditional database systems. In this paper we describe Atlas, a nested relational database system that has been designed for text-based applications. The Atlas query language is TQL, an SQL-like query language with text operators. The query language is supported by signature file text indexing techniques, and by a parser that can be configured for different text formats and even some foreign languages. Atlas can also be used to store images and audio.

[1] A.V. Aho and M.J. Corasick, “Efficient String Matching: An Aid to Bibliographic Search,” Comm. ACM, vol. 18, pp. 333-340, June 1979.
[2] D. Beech,“A foundation for evolution from relational to object databases.” J.W. Schmidt, S. Ceri, and M. Missilcoff, eds., Advances in Database Technology, no. 303, Lecture Notes in ComputerScience. Springer-Verlag, 1988.
[3] M. Carey,D. DeWitt,J. Richardson,, and E. Shetika,“Object and file management in the EXODUS extensible database system,” Proc. 12th Int’l Conf. Very Large Databases, pp. 91-100, Aug. 1986.
[4] P. Dadam et al., "A DBMS Prototype to Support Extended NF2Relations: An Integrated View on Flat Tables and Hierarchies," Proc. ACM SIGMOD Conf.,Washington D.C., pp. 356-367, 1986.
[5] Knowledge Engineering, Titan: User’s reference guide.Melbourne, Australia, 1990.
[6] O. Dexu et al., "The Story of O2," IEEE Trans. Knowledge and Data Eng., pp. 91-108, Mar. 1990.
[7] C. Faloutsos, “Access Methods for Text,” Computer Surveys, vol. 17, no. 1, pp. 49-74, 1985.
[8] M. Fuller,R. Sacks-Davis,R. Wilkinson,J. Zobel,, and E. Mackie, “Hyperbase systems: A structured architecture” Proc. Far-East Conf. Future Database Systems, pp. 222-230,Kyoto, Japan, 1992.
[9] L. Haas,W. Chang,G.M. Lohman et al., "Starburst mid-flight: As the dust clears," , IEEE Trans. Knowledge and Data Engineering, vol. 2, no. 1, pp. 143-160, Mar. 1990.
[10] ISO. Information processing—text and officesystems—Standard Generalized Markup Language (SGML), 1986. ISO 8879-1986(E).
[11] ISO. Information processing systems_database language SQL, 1986. Draft Int’l Standard 9075.
[12] M. Jarke and J. Koch, “Query Optimization in Database Systems,” ACM Computer Surveys, vol. 16, pp. 111–152, 1984.
[13] A. Kent,“The Tethys programming language,” Technical Report TR-91-1, Collaborative Information Technology Research Inst.,RMIT and Univ. of Melbourne, Melbourne, Australia, 1991.
[14] A.J. Kent,“A C language interface to TQL,” Technical Report 92-17, Collaborative Information Technology Research Inst.,RMIT and Univ. of Melbourne, Melbourne, Australia, 1992.
[15] A.J. Kent,“A simplified programming interface to Atlas,” Technical Report 92-18, Collaborative Information Technology Research Inst.,RMIT and Univ. of Melbourne, Melbourne, Australia, 1992.
[16] A.J. Kent,R. Sacks-Davis,, and K. Ramamohanarao,“A signature file scheme based on multiple organizations for indexing verylarge text databases,” J. American Soc. Information Science, vol. 41, no. 7, pp. 508-534, 1990.
[17] W. Kim,“Introduction to SQL/X,” Proc. Far-East Conf. Future Database Systems, pp. 2-7,Kyoto, Japan, 1992.
[18] D. Knuth, The Art of Computer Programming, vol. 3: Sorting and Searching. Addison-Wesley, 1973.
[19] P.-Å. Larson,“The data model and query language of LauRel,” Proc. IEEE Int’l Conf. Data Engineering, vol. 11, no. 3, 1988. (Special Issue on Nested Relations).
[20] G. Lohman, “Grammar-Like Functional Rules for Representing Query Optimization Alternatives,” Proc. ACM SIGMOD Conf. Management of Data, pp. 18-27, May 1988.
[21] J.B. Lovins,“Development of a stemming algorithm,” Mechanical Translation and Computation, vol. 11, no. 1-2, pp. 22-31, 1968.
[22] E. Mackie and J. Zobel,“Retrieval of tree-structured data from disc,” Proc. Third Australian Database Conf.,Melbourne, Australia, 1992.
[23] A. Moffat and J. Zobel,“Coding for compression in full-text retrieval systems,” Proc. IEEE Data Compression Conf., pp. 72-81,Snowbird, Utah, Mar. 1992.
[24] A. Moffat and J. Zobel,“Parameterized compression for sparse bitmaps,” Proc. ACM-SIGIR Int’l Conf. Research and Development in InformationRetrieval, pp. 274-285,Copenhagen, Denmark, June 1992.
[25] P. Pistor and F. Andersen,“Designing a generalized NF2model with an SQL-type language interface,” Proc. Int’l Conf. Very Large Databases, pp. 278-285,Kyoto, Japan, Aug. 1986.
[26] D.R. Raymond,“Lector—an interactive formatter for tagged text,” Technical Report OED-90-02, Centre for the New Oxford Dictionary and Text Research,Univ. of Waterloo, 1990.
[27] M.A. Roth, H.F. Korth, and D.S. Batory, "SQL/NF: A Query Language for Non-1NF Relational Databases," Information Systems, vol. 12, no. 1, pp. 99-114, 1987.
[28] M.A. Roth, H.F. Korth, and A. Silberschatz, “Extended Algebra and Calculus for Nested Relational Databases,” ACM Trans. Database Systems, vol. 13, no. 4, pp. 389–417, Dec. 1988.
[29] R. Sacks-Davis,A. Kent,, and K. Ramamohanarao,“Multikey access methods based on superimposed coding techniques,” ACM Trans. Database Systems, vol. 12, no. 4, pp. 655-696, Dec. 1987.
[30] R. Sacks-Davis and K. Ramamohanarao,“A two level superimposed coding scheme for partial match retrieval,” Information Systems, vol. 8, no. 4, pp. 273-280, 1983.
[31] K. Ramamohanarao, “Recursive Linear Hashing,” ACM Trans. Database Systems, vol. 9, no. 3, pp. 369-391, Sept. 1984.
[32] G. Salton and M. McGill, Introduction to Modern Information Retrieval, McGraw Hill, New York, 1983.
[33] R.W. Scheifler and J. Gettys., X Window System. Digital Press, 1990.
[34] H.-J. Schek,H.-B. Paul,M.H. Scholl,, and G. Weikum,“The DASDBS project: Objectives, experiences, and future prospects,” IEEE Trans. Knowledge and Data Engineering, vol. 2, no. 1, pp. 25-43, 1990.
[35] Verity Systems. TOPIC retrieval technology: A technical overview, 1990.
[36] Fulcrum Technologies. Fulcrum software product description. Ottawa, Canada.
[37] J.A. Thom,A.J. Kent,, and R. Sacks-Davis,“TQL: A nested relational query language,” Australian Computer J., vol. 23, no. 2, pp. 53-65, 1991.
[38] K. Wilkinson,P. Lyngbæk,, and W. Hasan,“The IRIS architecture and implementation,” IEEE Trans. Knowledge and Data Eng., vol. 2, no. 1, pp. 63-75, Mar. 1990.
[39] J. Zobel,A. Moffat,, and R. Sacks-Davis,“An efficient indexing technique for full-text database systems,” Proc. Int’l Conf. Very Large Databases, pp. 352-362,Vancouver, Canada, Aug. 1992.
[40] J. Zobel,J.A. Thom,, and R. Sacks-Davis,“Efficiency of nested relational document database systems,” Proc. Int’l Conf. Very Large Databases, pp. 91-102,Barcelona, Spain, 1991.

Index Terms:
Text database system, nested relations, signature files, text compression, hypermedia, hypertext.
Citation:
Ron Sacks-Davis, Alan Kent, Kotagiri Ramamohanarao, James Thom, Justin Zobel, "Atlas: A Nested Relational Database System for Text Applications," IEEE Transactions on Knowledge and Data Engineering, vol. 7, no. 3, pp. 454-470, June 1995, doi:10.1109/69.390250
Usage of this product signifies your acceptance of the Terms of Use.