Sciweavers

2635 search results - page 271 / 527
» Algorithms for the Database Layout Problem
Sort
View
PODS
2004
ACM
143views Database» more  PODS 2004»
16 years 6 months ago
Approximate Counts and Quantiles over Sliding Windows
We consider the problem of maintaining approximate counts and quantiles over fixed- and variablesize sliding windows in limited space. For quantiles, we present deterministic algo...
Arvind Arasu, Gurmeet Singh Manku
SISAP
2008
IEEE
115views Data Mining» more  SISAP 2008»
16 years 1 months ago
A Dynamic Pivot Selection Technique for Similarity Search
All pivot-based algorithms for similarity search use a set of reference points called pivots. The pivot-based search algorithm precomputes some distances to these reference points...
Benjamin Bustos, Oscar Pedreira, Nieves R. Brisabo...
ICDT
1999
ACM
97views Database» more  ICDT 1999»
15 years 11 months ago
Optimizing Large Join Queries in Mediation Systems
In data integration systems, queries posed to a mediator need to be translated into a sequence of queries to the underlying data sources. In a heterogeneous environment, with sour...
Ramana Yerneni, Chen Li, Jeffrey D. Ullman, Hector...
EDBT
2010
ACM
143views Database» more  EDBT 2010»
15 years 10 months ago
Efficient and scalable multi-geography route planning
This paper considers the problem of Multi-Geography Route Planning (MGRP) where the geographical information may be spread over multiple heterogeneous interconnected maps. We firs...
Vidhya Balasubramanian, Dmitri V. Kalashnikov, Sha...
UAI
2003
15 years 8 months ago
Robust Independence Testing for Constraint-Based Learning of Causal Structure
This paper considers a method that combines ideas from Bayesian learning, Bayesian network inference, and classical hypothesis testing to produce a more reliable and robust test o...
Denver Dash, Marek J. Druzdzel