Text / relational database management systems: Harmonizing SQL and SGML

  • G. E. Blake
  • M. P. Consens
  • P. Kilpeläinen
  • P. -Å. Larson
  • T. Snider
  • F. W. Tompa
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 819)


Combined text and relational database support is increasingly recognized as an emerging need of industry, spanning applications requiring text fields as parts of their data (e.g., for customer support) to those augmenting primary text resources by conventional relational data (e.g., for publication control). In this paper, we propose extensions to SQL that provide flexible and efficient access to structured text described by SGML. We also propose an architecture to support a text/relational database management system as a federated database environment, where component databases are accessed via “agents”: SQL agents that translate standard or extended SQL queries into vendorspecific dialects, and text agents that process text sub-queries on full-text search engines.


Database Management System Parse Tree Type Text Structure Text Query Optimization 
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. [ATA91]
    ATA 89-9C SFQL Committee, “Advanced Retrieval Standard —SFQL: Structured Full-text Query Language,” ATA specification 100, Rev 30, Version 2.2, Prerelease C, Air Transport Association, ATA 89-9C.SFQL V2.2/PR-C (October 1991) 84 pp.Google Scholar
  2. [Bil92]
    A. Biliris, “The Performance of Three Database Storage Structures for Managing Large Objects,” Proc. Sigmod 92, ACM, Sigmod Record, Vol. 21, No. 2 (June 1992) 276–285.CrossRefGoogle Scholar
  3. [Bla94]
    G.E. Blake, M.P. Consens, P. Kilpeläinen, P.-Å. Larson, T. Snider, and F.W. Tompa, “Text extensions to SQL,” internal report, Univ. of Waterloo Centre for the New OED and Text Research, 1994.Google Scholar
  4. [Chr94]
    V. Christophides, S. Abiteboul, S. Cluet, and M. Scholl, “From Structured Documents to Novel Query Facilities,” To appear in Proc. 13th. ACM SIG-MOD Conf., (May 1994).Google Scholar
  5. [Gol90]
    C. F. Goldfarb. The SGML Handbook. Oxford University Press, Oxford, 1990.zbMATHGoogle Scholar
  6. [Gon87]
    G. H. Gonnet and F. W. Tompa, “Mind Your Grammar: a New Approach to Modelling Text,” Very Large Data Bases (VLDB), Vol. 13 (September 1987) pp. 339–346.Google Scholar
  7. [ISO86]
    International Organization for Standardization, International Standard 8879: Information Processing — Text and Office Systems — Standard Generalized Markup Language (SGML), first edition — 1986-10-15(Ref. No. ISO 8879-1986(E)), 155 pp.Google Scholar
  8. [ISO90]
    International Organization for Standardization, “Information technology — Database Language SQL 2 Draft Report”, ISO Committee ISO/IEC JTC 1/SC 21, 1990.Google Scholar
  9. [Lar89a]
    P.-Å. Larson, “Relational Access to IMS Databases: Gateway Structure and Join Processing,” Project report, (available from the author), 1989.Google Scholar
  10. [Lar89b]
    P.-Å. Larson, H. AboElFotoh, M. Dionne, and F. Wang, “SQL Access to VAX DBMS Databases: Strategy Generation and Query Execution for Basic SPW Queries,” Project report (available from the first author), 1989.Google Scholar
  11. [Mar91]
    C. C. Marshall, F. G. Halasz, R. A. Rogers, and W. C. Janssen Jr., “Aquanet: a Hypertext Tool to Hold Your Knowledge in Place,” Proc. 3rd ACM Conf. on Hypertext: Hypertext 91, San Antonio (Dec. 1991) 261–275.Google Scholar
  12. [Mic92]
    Microsoft Corporation, Microsoft ODBC Application Programmer's Guide, Microsoft Corporation, 1992.Google Scholar
  13. [Ora92]
    Oracle Corporation, SQL * TextRetrieval Version 2 Technical Overview, Oracle Corporation, 1992. 45 pp.Google Scholar
  14. [Sac92]
    R. Sacks-Davis, A. Kent, K. Ramamohanarao, J. Thorn, and J. Zobel, “Atlas: a nested relational database system for text applications”, Technical Report CITRI/TR-92-52, Collaborative Information Technology Research, Victoria, Australia, July 1992.Google Scholar
  15. [Sal92]
    A. Salminen and F.W. Tompa. “PAT Expressions: an algebra for text search,” Papers in Computational Lexicography: COMPLEX '92, Proc. 2nd Int. Conf. on Computational Lexicography (F. Kiefer, G. Kiss, J. Pajzs ed.), Linguistics Inst., Hungarian Academy of Science, Budapest (October 1992), 309–332.Google Scholar
  16. [Sey92]
    Seybold Publications, “IDI Pursues Document Management,” Report on Publishing Systems, Vol. 21, No. 16, May 1992.Google Scholar
  17. [Wei85]
    E.S.C. Weiner. “The New OED: Problems in the Computerization of a Dictionary,” University Computing, Vol. 7 (1985) 66–71.Google Scholar
  18. [Zlo75]
    M.M. Zloof. “Query-by-Example: Operations on the Transitive Closure,” IBM Research Report RC 5526, Yorktown Heights, N.Y., 1975.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • G. E. Blake
    • 1
  • M. P. Consens
    • 1
  • P. Kilpeläinen
    • 1
  • P. -Å. Larson
    • 1
  • T. Snider
    • 1
  • F. W. Tompa
    • 1
  1. 1.UW Centre for the New OED and Text ResearchUniversity of WaterlooWaterlooCanada

Personalised recommendations