Filtering Search: A new approach to query-answering (1986)
| Venue: | SIAM J. Comput |
| Citations: | 98 - 8 self |
BibTeX
@ARTICLE{Chazelle86filteringsearch:,
author = {Bernard Chazelle},
title = {Filtering Search: A new approach to query-answering},
journal = {SIAM J. Comput},
year = {1986},
volume = {15},
pages = {703--724}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. We introduce a new technique for solving problems of the following form: preprocess a set ofobjects so that those satisfying a given property with respect to a query object canbe listed very effectively. Well-known problems that fall into this category include range search, point enclosure, intersection, and near-neighbor problems. The approach which we take is very general and rests on a new concept called filtering search.We show on a number ofexamples how it can be used to improve the complexity ofknown algorithms and simplify their implementations as well. In particular, filtering search allows us to improve on the worst-case complexity ofthe best algorithms known so far for solving the problems mentioned above. Key words, computational geometry, database, data structures, filtering search, retrieval problems
