Dimitris Papadias, Panos Kalnis, Nikos Mamoulis  Home/Search
Context Related
| cs.ust.hk/~kalnis/aaai99.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.ust.hk/~kalnis/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Several content-based queries in spatial databases and geographic information systems (GISs) can be modelled and processed as constraint satisfaction problems (CSPs). Regular CSP algorithms, however, work for main memory retrieval without utilizing indices to prune the search space. This paper shows how systematic and local search techniques can take advantage of the hierarchical decomposition of space, preserved by spatial data structures, to efficiently guide search. We study the... (Update)
Similar documents based on text: More All
0.4: An Adaptive Peer-to-Peer Network for Distributed.. - Kalnis, Ng, Ooi.. (2002) (Correct)
0.3: View Selection Using Randomized Search - Kalnis, Mamoulis, Papadias (2002) (Correct)
0.3: Content-Based Retrieval using Heuristic Search - Papadias, Mantzourogiannis.. (1999) (Correct)
BibTeX entry: (Update)
Papadias, D., Kalnis, P., Mamoulis, N. Hierarchical Constraint Satisfaction in Spatial Databases. AAAI, 142-147, 1999. http://citeseer.ist.psu.edu/papadias99hierarchical.html More
@inproceedings{ papadias99hierarchical,
author = "Dimitris Papadias and Panos Kalnis and Nikos Mamoulis",
title = "Hierarchical Constraint Satisfaction in Spatial Databases",
booktitle = "{AAAI}/{IAAI}",
pages = "142-147",
year = "1999",
url = "citeseer.ist.psu.edu/papadias99hierarchical.html" }
Citations (may not include all citations):1044 Maintaining Knowledge about Temporal Intervals (context) - Allen - 1983
765 trees: A Dynamic Index Structure for Spatial Searching (context) - Guttman - 1984
265 Increasing tree search efficiency for constraint satisfactio.. (context) - Haralick, Elliott - 1980
225 A Spatial Logic Based on Regions and Connection - Randell, Cui et al. - 1992
159 Efficient Processing of Spatial Joins Using R-trees (context) - Brinkhoff, Kriegel et al. - 1993
117 Reasoning about Binary Topological Relations (context) - Egenhofer - 1991
96 der, R., Seeger, B. "The R*- tree: an Efficient and Robust A.. (context) - Beckmann, Kriegel - 1990
68 An Empirical Study of Phase Transitions in Binary Constraint.. (context) - Prosser - 1996
39 Experimental Evaluation of preprocessing algorithms for cons.. (context) - Dechter, Meiri - 1994
24 Processing and Optimization of Multi-way Spatial Joins Using.. - Papadias, Mamoulis et al. - 1999
18 Efficient Local Search with Conflict minimization: A Case St.. - Sosic, Gu - 1994
5 Minimizing Conflicts: A Heuristic Method for Constraint-Sati.. (context) - Minton, Johnston et al. - 1992
Documents on the same site (http://www.cs.ust.hk/~kalnis/): More
Content-Based Retrieval using Heuristic Search - Papadias, Mantzourogiannis.. (1999) (Correct)
Optimization algorithms for simultaneous multidimensional.. - Kalnis, Papadias (2000) (Correct)
View Selection Using Randomized Search - Kalnis, Mamoulis, Papadias (2002) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC