Back to Search
Start Over
Ambiguity in Processing Boolean Queries on TDMS Tree Structures: A Study of Four Different Philosophies.
- Source :
-
IEEE Transactions on Software Engineering . Jul80, Vol. 6 Issue 4, p357-372. 17p. 1 Color Photograph, 4 Diagrams, 1 Chart. - Publication Year :
- 1980
-
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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00985589
- Volume :
- 6
- Issue :
- 4
- Database :
- Academic Search Index
- Journal :
- IEEE Transactions on Software Engineering
- Publication Type :
- Academic Journal
- Accession number :
- 14419909