Sciweavers

6274 search results - page 196 / 1255
» From query complexity to computational complexity
Sort
View
SIGMOD
1997
ACM
107views Database» more  SIGMOD 1997»
15 years 8 months ago
Range Queries in OLAP Data Cubes
A range query applies an aggregation operation over all selected cells of an OLAP data cube where the selection is speci ed by providing ranges of values for numeric dimensions. W...
Ching-Tien Ho, Rakesh Agrawal, Nimrod Megiddo, Ram...
ICMCS
2010
IEEE
210views Multimedia» more  ICMCS 2010»
15 years 5 months ago
A framework for extracting musical similarities from peer-to-peer networks
The usage of peer-to-peer (p2p) networks for music information retrieval (MIR) tasks is gaining momentum. P2P file sharing networks can be used for collecting both search queries ...
Noam Koenigstein, Yuval Shavitt, Tomer Tankel, Ela...
WWW
2007
ACM
16 years 5 months ago
Exploit sequencing views in semantic cache to accelerate xpath query evaluation
In XML databases, materializing queries and their results into views in a semantic cache can improve the performance of query evaluation by reducing computational complexity and I...
Jianhua Feng, Na Ta, Yong Zhang, Guoliang Li
VLDB
2006
ACM
147views Database» more  VLDB 2006»
16 years 4 months ago
Answering queries using materialized views with minimum size
In this paper we study the following problem. Given a database and a set of queries, we want to find a set of views that can compute the answers to the queries, such that the amoun...
Rada Chirkova, Chen Li, Jia Li
161
Voted
VLDB
2007
ACM
182views Database» more  VLDB 2007»
15 years 10 months ago
Continuous Queries in Oracle
This paper describes Continuous Queries (CQ) in Oracle RDBMS, a feature that incorporates stream and complex event processing into an RDBMS, the first such attempt in commercial d...
Sankar Subramanian, Srikanth Bellamkonda, Hua-Gang...