Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

W. Terry Hardgrave

dblp:11/3922 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 1980
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 2 · 2 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
2 papers
Data models and query languages · 56% Information retrieval · 22% Indexing and storage engines · 22%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data models and query languages › query language
query language semantics		 0.011980
Ambiguity in Processing Boolean Queries on TDMS Tree Structures: A Study of Four Different Philosophies · IEEE Trans. Software Eng. 1980
Information retrieval › retrieval models
boolean retrieval		 0.011979
Ambiguity in Processing Boolean Queries on TDMS Tree Structures: A Study of Four Different Philosophies · VLDB 1979
Indexing and storage engines
tree structures		 0.011979
Ambiguity in Processing Boolean Queries on TDMS Tree Structures: A Study of Four Different Philosophies · VLDB 1979

Methods — techniques the papers use, named apart from their topics

set theory · 0.0bolts formalism · 0.0
YearPublicationVenuePosition
1980 Ambiguity in Processing Boolean Queries on TDMS Tree Structures: A Study of Four Different Philosophies
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.
W. Terry Hardgrave
 IEEE Trans. Software Eng.1
1979 Ambiguity in Processing Boolean Queries on TDMS Tree Structures: A Study of Four Different Philosophies
W. Terry Hardgrave
 VLDB1
1978 Distributed database technology: An assessment
W. Terry Hardgrave
 Inf. Manag.1