DocumentCode
3473010
Title
Ambiguity In Processing Boolean Queries On TDMS Tree Structures: A Study Of Four Different Philosophies
Author
Hardgrave, W. Terry
Author_Institution
National Bureau of Standards and Department of Information Systems Management, University of Maryland
fYear
1979
fDate
3-5 Oct. 1979
Firstpage
373
Lastpage
397
Abstract
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 of any 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.
Keywords
ambiguity, Boolean, database, hierarchical, information, query, query language, semantics, TDMS, tree, tree structures; Bars; Database languages; Information analysis; Information management; Management information systems; NIST; Set theory; Time division multiplexing; Tree data structures; Vehicles;
fLanguage
English
Publisher
ieee
Conference_Titel
Very Large Data Bases, 1979. Fifth International Conference on
Conference_Location
Rio de Janeiro, Brazil
Type
conf
DOI
10.1109/VLDB.1979.718154
Filename
718154
Link To Document