|
|
|
@inproceedings{DBLP:conf/vldb/Hardgrave79,
author = {W. Terry Hardgrave},
editor = {Antonio L. Furtado and
Howard L. Morgan},
title = {Ambiguity in Processing Boolean Queries on TDMS Tree Structures:
A Study of Four Different Philosophies},
booktitle = {Fifth International Conference on Very Large Data Bases, October
3-5, 1979, Rio de Janeiro, Brazil, Proceedings},
publisher = {IEEE Computer Society},
year = {1979},
pages = {373-397},
ee = {db/conf/vldb/Hardgrave79.html},
crossref = {DBLP:conf/vldb/79},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
This paper defines and demonstrates four philosophies for processing queries on tree structures; shows that the data semantics of queries should be described by designating sets of nodes from which values for attributes may be returned to the data consumer; shows that the data semantics of database processing can be specified totally independent ofany machine, file structure or implementation; shows that set theory is a natural and effective vehicle for analyzing the semantics of queries on tree structures; and finally, shows that BOLTS is an adequate formalism for conveying the semantics of tree structure processing.
Key words: ambiguity; Boolean; database; hierarchical; information; query; query language; semantics; TDMS; tree; tree structures.
Copyright © 1979 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.
