Path Expressions for Complex Queries and Automatic Database Program Conversion.

@inproceedings{DBLP:conf/vldb/ShneidermanT80,
  author    = {Ben Shneiderman and
               Glenn Thomas},
  title     = {Path Expressions for Complex Queries and Automatic Database Program
               Conversion},
  booktitle = {Sixth International Conference on Very Large Data Bases, October
               1-3, 1980, Montreal, Quebec, Canada, Proceedings},
  publisher = {IEEE Computer Society},
  year      = {1980},
  pages     = {33-44},
  ee        = {db/conf/vldb/ShneidermanT80.html},
  crossref  = {DBLP:conf/vldb/80},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Our efforts to develop an automatic database system conversion facility yielded a powerful, yet simple query language which was designed for ease of conversion. The path expression of this query language is a convenient and appealing notation for describing complex traversals with multiple boolean qualifications. This paper describes the path expression, shows how automatic conversions can be done, introduces the boolean functions as part of the basic path expression, offers four extensions (path macros, implied path, path replacement, and path optimization), and discusses some implementation issues.

KEYWORDS:
data definition language, data manipulation language, transformation language, database conversion, program conversion, database systems, path expressions, query languages.

Copyright © 1980 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.

ACM SIGMOD Anthology

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/vldb7588 or /cdrom

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD1 or /dvd

Printed Edition

References

[Brosey and Shneiderman 1978]

...

[Hardgrave 1979]

W. Terry Hardgrave: Ambiguity in Processing Boolean Queries on TDMS Tree Structures: A Study of Four Different Philosophies. VLDB 1979: 373-397 BibTeX

[Lochovsky 1978]

...

[Reisner 1977]

Phyllis Reisner: Use of Psychological Experimentation as an Aid to Development of a Query Language. IEEE Trans. Software Eng. 3(3): 218-229(1977) BibTeX

[Senko 1975]

...

[Senko 1977]

...

[Shneiderman and Thomas 1979]

...

[Shoshani]

...

[Thomas and Shneiderman 1979]

...

[Thomas and Gould 1975]

...

Referenced by

1. Ben Shneiderman, Glenn Thomas: An Architecture for Automatic Relational Database System Conversion. ACM Trans. Database Syst. 7(2): 235-257(1982)
2. Sue M. Dintelman, A. Timothy Maness: An Implementation of a Query Language Supporting Path Expressions. SIGMOD Conference 1982: 87-93
3. Rowland R. Johnson: A Data Model for Integrating Statistical Interpretations. SSDBM 1981: 176-189
4. Rowland R. Johnson: Modelling Summary Data. SIGMOD Conference 1981: 93-97
5. Ramez Elmasri, Gio Wiederhold: GORDAS: A Formal High-Level Query Language for the Entity-Relationship Model. ER 1981: 49-72