DBScholar

Back to papers

Efficient Aggregation over Objects with Extent

Summary: Box-sum aggregation for objects with extent, including a novel functional box-sum where contribution is proportional to object–query intersection. Reduces both problems to dominance-sum and introduces disk/dynamic ECDF-B-trees plus a hybrid BA-tree that substantially outperforms an augmented R*-tree. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1256
Venue
PODS
Year
2002
Pagerank
5.4119882e-05
Overall Rank
8,555 | 41.31%
DOI
10.1145/543613.543629

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{zhang_pods02,
        address = {New York, NY, USA},
        series = {{PODS} '02},
        title = {{Efficient Aggregation over Objects with Extent}},
        url = {https://dl.acm.org/doi/10.1145/543613.543629},
        doi = {10.1145/543613.543629},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Zhang, Donghui and Tsotras, Vassilis J. and Gunopulos, Dimitrios},
        year = {2002}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
12,837 Efficient Integration and Aggregation of Historical Information 2002 SIGMOD 5.093636e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

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

Rank Cited Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Semantically Similar Papers