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.
VLDB 2026 Research / reviewers in the wild / expert

Diane Greene

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

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

Databases, data management, data science and information retrieval · 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
1 paper
Indexing and storage engines · 67% Spatial and temporal data management · 33%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%

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

TopicWeightPapersLastEvidence papers
Indexing and storage engines › multidimensional indexing
k-d-b-tree		 0.011989
An Implementation and Performance Analysis of Spatial Data Access Methods · ICDE 1989
Indexing and storage engines › spatial index
r-tree		 0.011989
An Implementation and Performance Analysis of Spatial Data Access Methods · ICDE 1989
Spatial and temporal data management
spatial indexing		 0.011989
An Implementation and Performance Analysis of Spatial Data Access Methods · ICDE 1989
YearPublicationVenuePosition
1989 An Implementation and Performance Analysis of Spatial Data Access Methods
abstract
Four spatial data access methods, R-trees, K-D-B-trees, R+trees, and 2-D-Isam, have been implemented within a preliminary version of the POSTGRES DBMS (database management system). These access methods have been tested over a range of shapes and sizes of two-dimensional objects and for a range of logical page sizes. The CPU time, number of disk reads and writes, and the resulting tree sizes have been tabulated for insert and retrieve operations. It is concluded that R-trees provide the best tradeoff between performance and implementation complexity and that choice of implementation is crucial to the performance of all the methods investigated.>
Diane Greene
 ICDE1