Sciweavers

1768 search results - page 341 / 354
» Mining Very Large Databases
Sort
View
VLDB
2001
ACM
82views Database» more  VLDB 2001»
14 years 2 months ago
Supporting Incremental Join Queries on Ranked Inputs
This paper investigates the problem of incremental joins of multiple ranked data sets when the join condition is a list of arbitrary user-defined predicates on the input tuples. ...
Apostol Natsev, Yuan-Chi Chang, John R. Smith, Chu...
VLDB
2001
ACM
94views Database» more  VLDB 2001»
14 years 2 months ago
FeedbackBypass: A New Approach to Interactive Similarity Query Processing
In recent years, several methods have been proposed for implementing interactive similarity queries on multimedia databases. Common to all these methods is the idea to exploit use...
Ilaria Bartolini, Paolo Ciaccia, Florian Waas
ICDE
2010
IEEE
203views Database» more  ICDE 2010»
14 years 2 months ago
Optimizing ETL workflows for fault-tolerance
Extract-Transform-Load (ETL) processes play an important role in data warehousing. Typically, design work on ETL has focused on performance as the sole metric to make sure that the...
Alkis Simitsis, Kevin Wilkinson, Umeshwar Dayal, M...
VLDB
1998
ACM
101views Database» more  VLDB 1998»
14 years 2 months ago
On Optimal Node Splitting for R-trees
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...
Yván J. García, Mario A. Lopez, Scot...
VLDB
1997
ACM
134views Database» more  VLDB 1997»
14 years 2 months ago
Spatial Joins Using R-trees: Breadth-First Traversal with Global Optimizations
R-tree based spatial join is useful because of both its superior performance and the wide spread implementation of R-trees. We present a new R-tree join method called BFRJ (Breadt...
Yun-Wu Huang, Ning Jing, Elke A. Rundensteiner