4469 search results - page 703 / 894 » Dynamic Program Slicing |
217
Voted
VLDB
2002
ACM
15 years 11 months ago
2002
ACM
Our aim is to develop new database technologies for the approximate matching of unstructured string data using indexes. We explore the potential of the suffix tree data structure i...
155
click to vote
SIGMOD
2009
ACM
15 years 11 months ago
2009
ACM
The ParAccel Analytic DatabaseTM is a fast shared-nothing parallel relational database system with a columnar orientation, adaptive compression, memory-centric design, and an enha...
93
Voted
SIGMOD
2004
ACM
15 years 11 months ago
2004
ACM
Cardinality estimation during query optimization relies on simplifying assumptions that usually do not hold in practice. To diminish the impact of inaccurate estimates during opti...
102
Voted
PODS
2002
ACM
15 years 11 months ago
2002
ACM
Data Warehousing and OLAPapplications typically view data as having multiple logical dimensions e.g., product, location with natural hierarchies de ned on each dimension. OLAP que...
84
Voted
EDBT
2008
ACM
15 years 11 months ago
2008
ACM
For complex data mining queries, query optimization issues arise, similar to those for the traditional database queries. However, few works have applied the cost-based query optim...