1263 search results - page 219 / 253 » A Scalable Algorithm for Answering Queries Using Views |
100
Voted
WWW
2002
ACM
16 years 3 months ago
2002
ACM
A large fraction of the useful web comprises of specification documents that largely consist of hattribute name, numeric valuei pairs embedded in text. Examples include product in...
106
Voted
FOCS
2008
IEEE
15 years 9 months ago
2008
IEEE
We consider the problem of online sublinear expander reconstruction and its relation to random walks in “noisy” expanders. Given access to an adjacency list representation of ...
114
click to vote
VLDB
2005
ACM
15 years 8 months ago
2005
ACM
Relational, XML and HTML data can be represented as graphs with entities as nodes and relationships as edges. Text is associated with nodes and possibly edges. Keyword search on s...
135
Voted
COMPGEOM
1998
ACM
15 years 6 months ago
1998
ACM
We present a new technique for constructing a data-structure that approximates shortest path maps in IRd . By applying this technique, we get the following two results on approxim...
119
click to vote
IPPS
1997
IEEE
15 years 6 months ago
1997
IEEE
The range tree is a fundamental data structure for multidimensional point sets, and as such, is central in a wide range of geometric anddatabaseapplications. Inthis paper, we desc...