2889 search results - page 102 / 578 » Querying Structured Hyperdocuments |
ISAAC
2007
Springer
14 years 2 months ago
2007
Springer
In this paper, we present two linear-size external memory data structures for approximate range searching. Our first structure, the BAR-B-tree, stores a set of N points in Rd and ...
ESA
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. In this paper we study the external memory planar point enclosure problem: Given N axis-parallel rectangles in the plane, construct a data structure on disk (an index) su...
RIAO
2007
13 years 9 months ago
2007
XML documents represent a middle range between unstructured data such as textual documents and fully structured data encoded in databases. Typically, information retrieval techniq...
ICDE
2009
IEEE
14 years 9 months ago
2009
IEEE
Abstract-- Answering approximate queries on string collections is important in applications such as data cleaning, query relaxation, and spell checking, where inconsistencies and e...
COMAD
2009
13 years 9 months ago
2009
The problem of information integration is discussed in the context of answering a query over the web. Querying the web requires that information from different web and other sourc...