This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Ambiguity in Processing Boolean Queries on TDMS Tree Structures: A Study of Four Different Philosophies
July 1980 (vol. 6 no. 4)
pp. 357-372
W.T. Hardgrave, Center for Programming Sciences and Technology, Institute for Computer Sciences and Technology, National Bureau of Standards
This paper defines and demonstrates four philosophies for processing queries on tree structures; shows that the data semantics of queries shuld be described by designating sets of nodes from which v values for attnbutes may be returned to the data consumer; shows that the data semantics of database processing can be specified totally independent of any madhine, 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.
Index Terms:
tree structures, Ambiguity, Boolean, database, hierarchical, information, query, query language, semantics, TDMS, tree
Citation:
W.T. Hardgrave, "Ambiguity in Processing Boolean Queries on TDMS Tree Structures: A Study of Four Different Philosophies," IEEE Transactions on Software Engineering, vol. 6, no. 4, pp. 357-372, July 1980, doi:10.1109/TSE.1980.234492
Usage of this product signifies your acceptance of the Terms of Use.