921 search results - page 135 / 185 » New Data Structures for Orthogonal Range Searching |
149
click to vote
CIKM
2010
Springer
15 years 2 months ago
2010
Springer
Current Information Retrieval systems use inverted index structures for efficient query processing. Due to the extremely large size of many data sets, these index structures are u...
158
click to vote
KDD
2005
ACM
16 years 4 months ago
2005
ACM
Web object is defined to represent any meaningful object embedded in web pages (e.g. images, music) or pointed to by hyperlinks (e.g. downloadable files). Users usually search for...
134
Voted
ESWS
2007
Springer
15 years 8 months ago
2007
Springer
We propose to design and study new techniques for description logic (DL) reasoning based on a prominent data structure that has been applied very successfully in various domains in...
132
click to vote
CP
2007
Springer
15 years 10 months ago
2007
Springer
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
118
click to vote
VLDB
2001
ACM
15 years 8 months ago
2001
ACM
Bulk loading refers to the process of creating an index from scratch for a given data set. This problem is well understood for B-trees, but so far, non-traditional index structure...