A formula for computing the number of quadtree node fragments created by a shift
Pattern Recognition Letters
Applications of spatial data structures: Computer graphics, image processing, and GIS
Applications of spatial data structures: Computer graphics, image processing, and GIS
Functional Programming
Computer vision using quadtree refinement (artificial intelligence, segmentation, knowledge)
Computer vision using quadtree refinement (artificial intelligence, segmentation, knowledge)
Hashing by proximity to process duplicates in spatial databases
CIKM '94 Proceedings of the third international conference on Information and knowledge management
A performance comparison of quadtree-based access methods for thematic maps
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
Improving min/max aggregation over spatial objects
Proceedings of the 9th ACM international symposium on Advances in geographic information systems
S*-Tree: An Improved S+-Tree for Coloured Images
ADBIS '99 Proceedings of the Third East European Conference on Advances in Databases and Information Systems
Object-based and image-based object representations
ACM Computing Surveys (CSUR)
Optimizing spatial Min/Max aggregations
The VLDB Journal — The International Journal on Very Large Data Bases
The new Casper: query processing for location services without compromising privacy
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Information Sciences: an International Journal
Developing a dynamic query system on location-based services
International Journal of Mobile Communications
Database and Representation Issues in Geographic Information Systems (GIS)
W2GIS '09 Proceedings of the 9th International Symposium on Web and Wireless Geographical Information Systems
Multidimensional data structures for spatial applications
Algorithms and theory of computation handbook
Adapting a map query interface for a gesturing touch screen interface
Proceedings of the 20th international conference companion on World wide web
Multifaceted toponym recognition for streaming news
Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval
Identification of live news events using Twitter
Proceedings of the 3rd ACM SIGSPATIAL International Workshop on Location-Based Social Networks
Similarity search on a large collection of point sets
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Searching web documents as location sets
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Porting a web-based mapping application to a smartphone app
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
RecDB: towards DBMS support for online recommender systems
PhD '12 Proceedings of the on SIGMOD/PODS 2012 PhD Symposium
Adaptive context features for toponym resolution in streaming news
SIGIR '12 Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval
Multiresolution select-distinct queries on large geographic point sets
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Supporting rapid processing and interactive map-based exploration of streaming news
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
TweetPhoto: photos from news tweets
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Hi-index | 0.00 |
Window operations serve as the basis of a number of queries that can be posed in a spatial database. Examples of these window-based queries include the exist query (i.e., determining whether or not a spatial feature exists inside a window) and the report query, (i.e., reporting the identity of all the features that exist inside a window). Algorithms are described for answering window queries in &Ogr;(n log logT) time for a window of size n x n in a feature space (e.g., an image) of size T x T (e.g., pixel elements). The significance of this result is that even though the window contains n2 pixel elements, the worst-case time complexity of the algorithms is almost linearly proportional (and not quadratic) to the window diameter, and does not depend on other factors. The above complexity bounds are achieved via the introduction of the incomplete pyramid data structure (a variant of the pyramid data structure) as the underlying representation to store spatial features and to answer queries on them.