Sciweavers

3777 search results - page 692 / 756
» Estimating the Quality of Databases
Sort
View
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
14 years 9 months ago
Sampling from large graphs
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
Jure Leskovec, Christos Faloutsos
VLDB
2007
ACM
119views Database» more  VLDB 2007»
14 years 9 months ago
Dynamic Workload Management for Very Large Data Warehouses: Juggling Feathers and Bowling Balls
Workload management for business intelligence (BI) queries poses different challenges than those addressed in the online transaction processing (OLTP) context. The fundamental pro...
Stefan Krompass, Umeshwar Dayal, Harumi A. Kuno, A...
SIGMOD
2009
ACM
202views Database» more  SIGMOD 2009»
14 years 9 months ago
ZStream: a cost-based query processor for adaptively detecting composite events
Composite (or Complex) event processing (CEP) systems search sequences of incoming events for occurrences of userspecified event patterns. Recently, they have gained more attentio...
Yuan Mei, Samuel Madden
SIGMOD
2008
ACM
123views Database» more  SIGMOD 2008»
14 years 9 months ago
Query-based partitioning of documents and indexes for information lifecycle management
Regulations require businesses to archive many electronic documents for extended periods of time. Given the sheer volume of documents and the response time requirements, documents...
Soumyadeb Mitra, Marianne Winslett, Windsor W. Hsu
PODS
2002
ACM
168views Database» more  PODS 2002»
14 years 9 months ago
Conjunctive Selection Conditions in Main Memory
We consider the fundamental operation of applying a conjunction of selection conditions to a set of records. With large main memories available cheaply, systems may choose to keep...
Kenneth A. Ross