371 search results - page 11 / 75 » On Two-Dimensional Indexability and Optimal Range Search Ind... |
SIGMOD
1989
ACM
15 years 1 months ago
1989
ACM
Spatial objects other than points and boxes can be stored in spatial indexes, but the techniques usually require the use of approximations that can be arbitrarily bad. This leads ...
MICAI
2004
Springer
15 years 3 months ago
2004
Springer
A number of problems in computer science can be solved efficiently with the so called memory based or kernel methods. Among this problems (relevant to the AI community) are multime...
IPTPS
2003
Springer
15 years 2 months ago
2003
Springer
This paper discusses the feasibility of peer-to-peer full-text keyword search of the Web. Two classes of keyword search techniques are in use or have been proposed: flooding of q...
BIRTHDAY
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Database preprocessing in order to create an index often permits considerable speedup in search compared to the iterated query of an unprocessed database. In this paper w...
161
click to vote
ICDE
2005
IEEE
15 years 11 months ago
2005
IEEE
Index structures are designed to optimize search performance, while at the same time supporting efficient data updates. Although not explicit, existing index structures are typica...