Ambiguity in Processing Boolean Queries on TDMS Tree Structures: A Study of Four Different Philosophies

Author

Hardgrave, W. Terry

Author_Institution

Center for Programming Sciences and Technology, Institute for Computer Sciences and Technology, National Bureau of Standards

Issue

4

fYear

1980

fDate

7/1/1980 12:00:00 AM

Firstpage

357

Lastpage

372

Abstract

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.

Keywords

Ambiguity; Boolean; TDMS; database; hierarchical; information; query; query language; semantics; tree; tree structures; Bars; Data models; Database languages; Database systems; Fasteners; Helium; Set theory; Time division multiplexing; Tree data structures; Vehicles; Ambiguity; Boolean; TDMS; database; hierarchical; information; query; query language; semantics; tree; tree structures;

fLanguage

English

Journal_Title

Software Engineering, IEEE Transactions on

Publisher

ieee

ISSN

0098-5589

Type

jour

DOI

10.1109/TSE.1980.234492

Filename

1702744