Please use this identifier to cite or link to this item:

Improving Search Using Indexing: A Study with Temporal CSPs

Authors Mamoulis, N. HKUST affiliated (currently or previously)
Papadias, D. View this author's profile
Issue Date 1999
Source 16th International Joint Conference on Artificial Intelligence, IJCAI 1999; Stockholm; Sweden , v. 1, 1999, p. 436-441
Summary 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.
ISSN 1045-0823
ISBN 1558606130
Language English
Format Conference paper
Access View full-text via Web of Science
View full-text via Scopus
Files in this item:
File Description Size Format
ijcai99.pdf 72935 B Adobe PDF