|
HKUST Institutional Repository >
Computer Science and Engineering >
CSE Conference Papers >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1783.1/153
|
| Title: | Hierarchical constraint satisfaction in spatial databases |
| Authors: | Papadias, Dimitris
Kalnis, Panagiotis
Mamoulis, Nikos |
| Keywords: | Spatial databases
Geographic information systems
GIS
Constraint satisfaction problems
CSP |
| Issue Date: | 1999 |
| Citation: | Proceedings of the 16th Annual National Conference on Artificial Intelligence, Orlando, FL, USA, 18-22 July, AAAI, Menlo Park, CA, USA, 1999, p. 142-147 |
| 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 conditions under which hierarchical constraint satisfaction outperforms traditional methods with extensive experimentation. |
| URI: | http://hdl.handle.net/1783.1/153 |
| Appears in Collections: | CSE Conference Papers
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| aaai99.pdf | | 123Kb | Adobe PDF | View/Open |
|
All items in this Repository are protected by copyright, with all rights reserved.
|
