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

Sam Haradhvala

dblp:05/953 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1992
—ORCID · none

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

Databases, data management, data science and information retrieval · 1

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
1 paper
Query processing and optimization · 56% Data models and query languages · 44%

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

TopicWeightPapersLastEvidence papers
Data models and query languages
object-oriented database
0.011992
Query Processing in the ObjectStore Database System · SIGMOD Conference 1992
Query processing and optimization › complex data query processing
object-oriented query processing
0.011992
Query Processing in the ObjectStore Database System · SIGMOD Conference 1992

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

query operator integration · 0.0path indexing · 0.0
YearPublicationVenuePosition
1992 Query Processing in the ObjectStore Database System
abstract
ObjectStore is an object-oriented database system supporting persistence orthogonal to type, transaction management, and associative queries. Collections are provided as objects. The data model is non-1NF, as objects may have embedded collections. Queries are integrated with the host language in the form of query operators whose operands are a collection and a predicate. The predicate may itself contain a (nested) query operating on an embedded collection. Indexes on paths may be added and removed dynamically. Collections, being treated as objects, may be referred to indirectly, e.g., through a by-reference argument. For this reason and others, multiple execution strategies are generated, and a final selection is made just prior to query execution. Nested queries can result in interleaved execution and strategy selection.
Jack A. Orenstein, Sam Haradhvala, Benson Margulies, Don Sakahara
SIGMOD Conference2