On computing top-t most influential spatial sites

VLDB 2005 - Proceedings of 31st International Conference on Very Large Data Bases

Volumn 3, Issue , 2005, Pages 946-957

  Xia, Tian ^a   Zhang, Donghui ^a   Kanoulas, Evangelos ^a   Du, Yang ^a  

^a Northeastern University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

R-TREE; RNN QUERY; SPATIAL SITES; TOPLNFLUENTIAL-SITES;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; DATABASE SYSTEMS; PROBLEM SOLVING; TREES (MATHEMATICS);

QUERY LANGUAGES;

EID: 33745604025     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. [BJKv02] R. Benetis, C. S. Jensen, G. Karčiauskas, and S. Šaltenis. Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects. In Proc. of Int. Database Engineering & Applications Symposium (IDEAS), pages 44-53, 2002.
2. [BKOS97] M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Sprinter Verlag, 1997.
3. [FSAE01] H. Ferhatosmanoglu, I. Stanoia, D. Agrawal, and A El Abbadi. Constrained Nearest Neighbor Queries. In Proc. of Symposium on Spatial and Temporal Databases (SSTD), pages 257-278, 2001.
4. [KM00] F. Korn and S. Muthukrishnan. Influence Sets Based on Reverse Nearest Neighbor Queries. In ACM SIGMOD, pages 201-212, 2000.
5. [KMS02] F. Korn, S. Muthukrishnan, and D. Srivastava. Reverse Nearest Neighbor Aggregates Over Data Streams. In VLDB, pages 814-825, 2002.
6. [LNY03] K.-I. Lin, M. Nolen, and C. Yang. Applying Bulk Insertion Techniques for Dynamic Reverse Nearest Neighbor Problems. In Proc. of Int. Database Engineering & Applications Symposium (IDEAS), pages 290-297, 2003.
7. [MVZ02] A. Maheshwari, J. Vahrenhold, and N. Zeh. On Reverse Nearest Neighbor Queries. In Proc. of Canadian Conf. on Computational Geometry (CCCG), pages 128-132, 2002.
8. [PKZT01] D. Papadias, P. Kalnis, J. Zhang, and Y. Tao. Efficient OLAP Operations in Spatial Data Warehouses. In Proc. of Symposium on Spatial and Temporal Databases (SSTD), pages 443-459, 2001.
9. [RKV95] N. Roussopoulos, S. Kelley, and F. Vincent. Nearest Neighbor Queries. In ACM SIGMOD, pages 71-79, 1995.
10. [SAE00] I. Stanoi, D. Agrawal, and A. El Abbadi. Reverse Nearest Neighbor Queries for Dynamic Databases. In ACM/SIGMOD Int. Workshop on Research Issues on Data Mining and Knowledge Discovery (DMKD), pages 44-53, 2000.
11. [SFT03] A. Singh, H. Ferhatosmanoglu, and A. S. Tosun. High dimensional reverse nearest neighbor queries. In Proc. of Int. Conf. on Information and Knowledge Management (CIKM), pages 91-98, 2003.
12. [Smi97] M. Smid. Closest Point Problems in Computational Geometry. In J.-R. Sack and J. Urrutia, editors, Handbook on Computational Geometry. Elsevier Science Publishing, 1997.
13. [SRAE01] I. Stanoi, M. Riedewald, D. Agrawal, and A. El Abbadi. Discovery of Influence Sets in Frequently Updated Databases. In VLDB, pages 99-108, 2001.
14. [The03] Yannis Theodoridis. The R-tree-portal. http://www.rtreeportal. org, 2003.
15. [TPL04] Y. Tao, D. Papadias, and X. Lian. Reverse kNN Search in Arbitrary Dimensionality. In VLDB, pages 744-755, 2004.
16. [YL01] C. Yang and K.-I. Lin. An index structure for efficient reverse nearest neighbor queries. In ICDE, pages 485-492, 2001.
17. [YPMT05] M. L. Yiu, D. Papadias, N. Mamoulis, and Y. Tao. Reverse Nearest Neighbors in Large Graphs. In ICDE, pages 186-187, 2005.