Sciweavers

285 search results - page 15 / 57
» A New Heuristic for Optimizing Large Queries
Sort
View
VLDB
2004
ACM
163views Database» more  VLDB 2004»
14 years 25 days ago
Compressing Large Boolean Matrices using Reordering Techniques
Large boolean matrices are a basic representational unit in a variety of applications, with some notable examples being interactive visualization systems, mining large graph struc...
David S. Johnson, Shankar Krishnan, Jatin Chhugani...
SIGMOD
1999
ACM
101views Database» more  SIGMOD 1999»
13 years 11 months ago
Join Synopses for Approximate Query Answering
In large data warehousing environments, it is often advantageous to provide fast, approximate answers to complex aggregate queries based on statistical summaries of the full data....
Swarup Acharya, Phillip B. Gibbons, Viswanath Poos...
PDPTA
2004
13 years 9 months ago
Efficient Disk Replacement and Data Migration Algorithms for Large Disk Subsystems
Random data placement has recently emerged as an alternative to traditional data striping. From a performance perspective, it has been demonstrated to be an efficient and scalable...
Roger Zimmermann, Beomjoo Seo
IPL
2008
131views more  IPL 2008»
13 years 7 months ago
Ant colony optimization with partial order reduction for discovering safety property violations in concurrent models
In this article we analyze the combination of ACOhg, a new metaheuristic algorithm, plus partial order reduction applied to the problem of finding safety property violations in co...
J. Francisco Chicano, Enrique Alba
XSYM
2004
Springer
88views Database» more  XSYM 2004»
14 years 25 days ago
Teaching Relational Optimizers About XML Processing
Due to their numerous benefits, relational systems play a major role in storing XML documents. XML also benefits relational systems by providing a means to publish legacy relatio...
Sihem Amer-Yahia, Yannis Kotidis, Divesh Srivastav...