3225 search results - page 310 / 645 » Query Optimization by Stored Queries |
182
click to vote
VLDB
2002
ACM
15 years 6 months ago
2002
ACM
Traditional indexes aim at optimizing the node accesses during query processing, which, however, does not necessarily minimize the total cost due to the possibly large number of r...
279
click to vote
ICDE
2003
IEEE
16 years 8 months ago
2003
IEEE
Expressing complex OLAP queries using group-by, aggregation, and joins can be extremely difficult. As a result of this, many alternate ways of expressing such queries have been de...
149
click to vote
KDD
1997
ACM
15 years 10 months ago
1997
ACM
An approach to defining actionability as a measure of interestingness of patterns is proposed. This approach is based on the concept of an action hierarchy which is defined as a t...
163
Voted
SODA
2008
ACM
15 years 8 months ago
2008
ACM
A data structure is presented for point location in convex planar subdivisions when the distribution of queries is known in advance. The data structure has an expected query time t...
299
click to vote
ICDE
2005
IEEE
16 years 8 months ago
2005
IEEE
Data warehousing and on-line analytical processing (OLAP) are essential for decision support applications. Common OLAP operations include for example drill down, roll up, pivot an...