HKUST Library Institutional Repository Banner

HKUST Institutional Repository >
Computer Science and Engineering >
CSE Conference Papers >

Please use this identifier to cite or link to this item:
Title: Improving search using indexing : a study with temporal CSPs
Authors: Mamoulis, Nikos
Papadias, Dimitris
Keywords: Constraint satisfaction problems
Issue Date: 1999
Citation: IJCAI : proceedings of the Conference, Stockholm, Sweden, 31 July-6 Aug. 1999, IJCAI Somerset, NJ, USA, 1999, p. 436-441
Abstract: Most studies concerning constraint satisfaction problems (CSPs) involve variables that take values from small domains. This paper deals with an alternative form of temporal CSPs; the number of variables is relatively small and the domains are large collections of intervals. Such situations may arise in temporal databases where several types of queries can be modeled and processed as CSPs. For these problems, systematic CSP algorithms can take advantage of temporal indexing to accelerate search. Directed search versions of chronological backtracking and forward checking are presented and tested. Our results show that indexing can drastically improve search performance.
Appears in Collections:CSE Conference Papers

Files in This Item:

File Description SizeFormat
ijcai99.pdf71KbAdobe PDFView/Open

All items in this Repository are protected by copyright, with all rights reserved.