6654 search results - page 1104 / 1331 » Querying Faceted Databases |
193
click to vote
PODS
2005
ACM
16 years 6 months ago
2005
ACM
We consider a scenario where we want to query a large dataset that is stored in external memory and does not fit into main memory. The most constrained resources in such a situati...
175
click to vote
PODS
2006
ACM
16 years 6 months ago
2006
ACM
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
213
click to vote
EDBT
2004
ACM
16 years 6 months ago
2004
ACM
There is a growing interest in on-line algorithms for analyzing and querying data streams, that examine each stream element only once and have at their disposal, only a limited amo...
142
click to vote
EDBT
2008
ACM
16 years 6 months ago
2008
ACM
Transportation?related problems, like road congestion, parking, and pollution, are increasing in most cities. In order to reduce traffic, recent work has proposed methods for vehi...
133
click to vote
ICDE
2010
IEEE
16 years 6 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...