277 search results - page 28 / 56 » Opportunistic Data Structures for Range Queries |
STACS
1997
Springer
14 years 28 days ago
1997
Springer
We consider the problem of maintaining a set of n integers in the range 0::2w ? 1 under the operations of insertion, deletion, predecessor queries, minimum queries and maximum quer...
WWW
2009
ACM
14 years 9 months ago
2009
ACM
Web search engines often federate many user queries to relevant structured databases. For example, a product related query might be federated to a product database containing thei...
JEA
2008
13 years 8 months ago
2008
The Spatial Approximation Tree (sa-tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alternative data...
RR
2010
Springer
13 years 7 months ago
2010
Springer
Semantic wikis and other modern knowledge management systems deviate from traditional knowledge bases in that information ranges from unstructured (wiki pages) over semi-formal (ta...
CIKM
2005
Springer
14 years 2 months ago
2005
Springer
In this paper, we propose a versatile disambiguation approach which can be used to make explicit the meaning of structure based information such as XML schemas, XML document struc...