Sciweavers

907 search results - page 14 / 182
» Efficient Optimization of Iterative Queries
Sort
View
SIGMOD
2005
ACM
228views Database» more  SIGMOD 2005»
14 years 7 months ago
ConQuer: Efficient Management of Inconsistent Databases
Although integrity constraints have long been used to maintain data consistency, there are situations in which they may not be enforced or satisfied. In this paper, we present Con...
Ariel Fuxman, Elham Fazli, Renée J. Miller
FAW
2008
Springer
127views Algorithms» more  FAW 2008»
13 years 9 months ago
Visiting a Polygon on the Optimal Way to a Query Point
Abstract. We study a constrained version of the shortest path problem in polygonal domains, in which the path must visit a given target polygon. We provide an efficient algorithm f...
Ramtin Khosravi, Mohammad Ghodsi
EDBT
2009
ACM
92views Database» more  EDBT 2009»
13 years 11 months ago
Efficient skyline computation in metric space
Given a set of n query points in a general metric space, a metricspace skyline (MSS) query asks what are the closest points to all these query points in the database. Here, consid...
David Fuhry, Ruoming Jin, Donghui Zhang
SIGMOD
2001
ACM
120views Database» more  SIGMOD 2001»
14 years 7 months ago
Materialized View Selection and Maintenance Using Multi-Query Optimization
Materialized views have been found to be very effective at speeding up queries, and are increasingly being supported by commercial databases and data warehouse systems. However, w...
Hoshi Mistry, Prasan Roy, S. Sudarshan, Krithi Ram...
RSCTC
2000
Springer
143views Fuzzy Logic» more  RSCTC 2000»
13 years 11 months ago
On Efficient Construction of Decision Trees from Large Databases
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
Hung Son Nguyen