Sciweavers

106 search results - page 18 / 22
» Scalable approximate query processing with the DBO engine
Sort
View
VLDB
2007
ACM
166views Database» more  VLDB 2007»
14 years 1 months ago
To Share or Not To Share?
Intuitively, aggressive work sharing among concurrent queries in a database system should always improve performance by eliminating redundant computation or data accesses. We show...
Ryan Johnson, Nikos Hardavellas, Ippokratis Pandis...
SIGMOD
2005
ACM
220views Database» more  SIGMOD 2005»
14 years 7 months ago
Sampling Algorithms in a Stream Operator
Complex queries over high speed data streams often need to rely on approximations to keep up with their input. The research community has developed a rich literature on approximat...
Theodore Johnson, S. Muthukrishnan, Irina Rozenbau...
CLUSTER
2009
IEEE
14 years 1 months ago
Analyzing massive astrophysical datasets: Can Pig/Hadoop or a relational DBMS help?
Abstract— As the datasets used to fuel modern scientific discovery grow increasingly large, they become increasingly difficult to manage using conventional software. Parallel d...
Sarah Loebman, Dylan Nunley, YongChul Kwon, Bill H...
HOTSWUP
2009
ACM
13 years 11 months ago
Automating Database Schema Evolution in Information System Upgrades
The complexity, cost, and down-time currently created by the database schema evolution process is the source of incessant problems in the life of information systems and a major s...
Carlo Curino, Hyun Jin Moon, Carlo Zaniolo
KDD
2005
ACM
162views Data Mining» more  KDD 2005»
14 years 7 months ago
Discovering frequent topological structures from graph datasets
The problem of finding frequent patterns from graph-based datasets is an important one that finds applications in drug discovery, protein structure analysis, XML querying, and soc...
Ruoming Jin, Chao Wang, Dmitrii Polshakov, Sriniva...