22 search results - page 2 / 5 » Processing Star Queries on Hierarchically-Clustered Fact Tab... |
EDBT
2004
ACM
14 years 5 months ago
2004
ACM
Abstract. Hierarchical clustering has been proved an effective means for physically organizing large fact tables since it reduces significantly the I/O cost during ad hoc OLAP quer...
EDBT
2008
ACM
14 years 5 months ago
2008
ACM
In this paper we study the problem of mining all frequent queries in a given database table, a problem known to be intractable even for conjunctive queries. We restrict our attent...
WWW
2011
ACM
12 years 11 months ago
2011
ACM
Recently answers for fact lookup queries have appeared on major search engines. For example, for the query {Barack Obama date of birth} Google directly shows “4 August 1961” a...
ICDIM
2010
IEEE
13 years 2 months ago
2010
IEEE
Data mining aims at extraction of previously unidentified information from large databases. It can be viewed as an automated application of algorithms to discover hidden patterns a...
EDBT
2000
ACM
13 years 8 months ago
2000
ACM
OLAP applications use precomputation of aggregate data to improve query response time. While this problem has been well-studied in the recent database literature, to our knowledge ...