110 search results - page 13 / 22 » Query evaluation using overlapping views: completeness and e... |
DOLAP
2000
ACM
14 years 1 months ago
2000
ACM
Being able to efficiently answer arbitrary OLAP queries that aggregate along any combination of dimensions over numerical and categorical attributes has been a continued, major co...
SPIRE
2004
Springer
14 years 2 months ago
2004
Springer
Abstract Searching information resources using mobile devices is affected by displays on which only a small fraction of the set of ranked documents can be displayed. In this study ...
SIGMOD
2007
ACM
14 years 9 months ago
2007
ACM
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...
CN
2010
13 years 9 months ago
2010
Distributed hash tables (DHTs) are very efficient for querying based on key lookups. However, building huge term indexes, as required for IR-style keyword search, poses a scalabil...
ICDE
2003
IEEE
14 years 10 months ago
2003
IEEE
This paper presents SPEX, a streamed and progressive evaluation of regular path expressions with XPath-like qualifiers against XML streams. SPEX proceeds as follows. An expression...