Efficient probabilistic reverse nearest neighbor query processing on uncertain data
Open Access
- 1 July 2011
- journal article
- Published by Association for Computing Machinery (ACM) in Proceedings of the VLDB Endowment
- Vol. 4 (10) , 669-680
Abstract
No abstract availableThis publication has 22 references indexed in Scilit:
- Ranking continuous probabilistic datasetsProceedings of the VLDB Endowment, 2010
- A unified approach to ranking in probabilistic databasesProceedings of the VLDB Endowment, 2009
- Efficient processing of probabilistic reverse nearest neighbor queries over uncertain dataThe VLDB Journal, 2009
- Probabilistic Inverse Ranking Queries over Uncertain Data2009
- Efficient search for the top-k probable nearest neighbors in uncertain databasesProceedings of the VLDB Endowment, 2008
- Orion 2.02008
- Querying imprecise data in moving object environmentsIEEE Transactions on Knowledge and Data Engineering, 2004
- kReverse NN Search in Arbitrary Dimensionality2004
- R-trees1984
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975