DBScholar

Back to papers

Query Processing Method for Multi-Attribute Clustered Relations

Summary: Introduces “waves,” memory-fitting, index-guided groups of pages that impose an effective load order on multi-attribute clustered relations lacking a total order. Evaluated with KD-trees and Grid files, it approaches one-relation-scan I/O. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
8123
Venue
VLDB
Year
1990
Pagerank
7.1391812e-05
Overall Rank
3,771 | 74.13%
DOI
-

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{harada_vldb90,
        title = {{Query Processing Method for Multi-Attribute Clustered Relations}},
        author = {Harada, Lilian and Nakano, Miyuki and Kitsuregawa, Masaru and Takagi, Mikio},
        journal = {PVLDB},
        series = {{VLDB} '90},
        year = {1990}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
145 Efficient Processing of Spatial Joins Using R-trees 1993 SIGMOD 0.00029548428
728 Partition Based Spatial-Merge Join 1996 SIGMOD 0.00014542772
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 10 of 10 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers