A scalable algorithm for maximizing range sum in spatial databases
Open Access
- 1 July 2012
- journal article
- Published by Association for Computing Machinery (ACM) in Proceedings of the VLDB Endowment
- Vol. 5 (11) , 1088-1099
Abstract
No abstract availableAll Related Versions
This publication has 17 references indexed in Scilit:
- Efficient processing of top-k spatial preference queriesProceedings of the VLDB Endowment, 2010
- Efficient method for maximizing bichromatic reverse nearest neighborProceedings of the VLDB Endowment, 2009
- Indexing range sum queries in spatio-temporal databasesInformation and Software Technology, 2007
- The Optimal-Location Query2005
- Efficient OLAP Operations in Spatial Data Warehouses2001
- A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboidsComputers & Mathematics with Applications, 1995
- A general lower bound on the I/O-complexity of comparison-based algorithms1993
- On a circle placement problemComputing, 1986
- Finding the connected components and a maximum clique of an intersection graph of rectangles in the planeJournal of Algorithms, 1983
- Note—On a Modified One-Center ModelManagement Science, 1981