Sciweavers

16596 search results - page 2889 / 3320
» Generalized Assignment Problems
Sort
View
SIGMOD
2008
ACM
142views Database» more  SIGMOD 2008»
16 years 7 months ago
Cost-based variable-length-gram selection for string collections to support approximate queries efficiently
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
Xiaochun Yang, Bin Wang, Chen Li
SIGMOD
2008
ACM
98views Database» more  SIGMOD 2008»
16 years 7 months ago
Damia: data mashups for intranet applications
Increasingly large numbers of situational applications are being created by enterprise business users as a by-product of solving day-to-day problems. In efforts to address the dem...
David E. Simmen, Mehmet Altinel, Volker Markl, Sri...
SIGMOD
2008
ACM
193views Database» more  SIGMOD 2008»
16 years 7 months ago
ARCube: supporting ranking aggregate queries in partially materialized data cubes
Supporting ranking queries in database systems has been a popular research topic recently. However, there is a lack of study on supporting ranking queries in data warehouses where...
Tianyi Wu, Dong Xin, Jiawei Han
SIGMOD
2007
ACM
197views Database» more  SIGMOD 2007»
16 years 7 months ago
Automated and on-demand provisioning of virtual machines for database applications
Utility computing delivers compute and storage resources to applications as an `on-demand utility', much like electricity, from a distributed collection of computing resource...
Piyush Shivam, Azbayar Demberel, Pradeep Gunda, Da...
SIGMOD
2007
ACM
219views Database» more  SIGMOD 2007»
16 years 7 months ago
Efficient exploitation of similar subexpressions for query processing
Complex queries often contain common or similar subexpressions, either within a single query or among multiple queries submitted as a batch. If so, query execution time can be imp...
Jingren Zhou, Johann Christoph Freytag, Per-Å...
« Prev « First page 2889 / 3320 Last » Next »