Sciweavers

491 search results - page 46 / 99
» Optimizing complex queries with multiple relation instances
Sort
View
ITCC
2005
IEEE
14 years 1 months ago
Design Theoretic Approach to Replicated Declustering
Declustering techniques reduce query response times through parallel I/O by distributing data among multiple devices. Most of the research on declustering is targeted at spatial r...
Ali Saman Tosun
SIGMOD
2003
ACM
150views Database» more  SIGMOD 2003»
14 years 7 months ago
Capturing both Types and Constraints in Data Integration
We propose a framework for integrating data from multiple relational sources into an XML document that both conforms to a given DTD and satisfies predefined XML constraints. The f...
Michael Benedikt, Chee Yong Chan, Wenfei Fan, Juli...
ECCV
2008
Springer
14 years 9 months ago
Feature Correspondence Via Graph Matching: Models and Global Optimization
Abstract. In this paper we present a new approach for establishing correspondences between sparse image features related by an unknown non-rigid mapping and corrupted by clutter an...
Lorenzo Torresani, Vladimir Kolmogorov, Carsten Ro...
DMDW
2000
93views Management» more  DMDW 2000»
13 years 9 months ago
Storing auxiliary data for efficient maintenance and lineage tracing of complex views
As views in a data warehouse become more complex, the view maintenance process can become very complicated and potentially very inefficient. Storing auxiliary views in the warehou...
Yingwei Cui, Jennifer Widom
ECAI
2000
Springer
13 years 12 months ago
A Property of Path Inverse Consistency Leading to an Optimal PIC Algorithm
Abstract. In constraint networks, the efficiency of a search algorithm is strongly related to the local consistency maintained during search. For a long time, it has been consider...
Romuald Debruyne