Sciweavers

964 search results - page 34 / 193
» Efficiently Ordering Query Plans for Data Integration
Sort
View
VLDB
2007
ACM
102views Database» more  VLDB 2007»
16 years 4 months ago
Randomized Algorithms for Data Reconciliation in Wide Area Aggregate Query Processing
Many aspects of the data integration problem have been considered in the literature: how to match schemas across different data sources, how to decide when different records refer...
Fei Xu, Chris Jermaine
PUK
2000
15 years 5 months ago
Scheduling in a Planning Environment
In a real planning problem, there exists a set of constraints (both temporal constraints and resource usage constraints) which must be satisfied in order to obtain a feasible plan....
Antonio Garrido Tejero, Miguel A. Salido, Federico...
AIR
2000
91views more  AIR 2000»
15 years 4 months ago
PlanMine: Predicting Plan Failures Using Sequence Mining
This paper presents the PLANMINE sequence mining algorithm to extract patterns of events that predict failures in databases of plan executions. New techniques were needed because p...
Mohammed Javeed Zaki, Neal Lesh, Mitsunori Ogihara
CORR
2010
Springer
94views Education» more  CORR 2010»
15 years 4 months ago
Discovery of Convoys in Trajectory Databases
As mobile devices with positioning capabilities continue to proliferate, data management for so-called trajectory databases that capture the historical movements of populations of...
Hoyoung Jeung, Man Lung Yiu, Xiaofang Zhou, Christ...
SODA
2004
ACM
137views Algorithms» more  SODA 2004»
15 years 5 months ago
The Bloomier filter: an efficient data structure for static support lookup tables
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...
Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ay...