Sciweavers

383 search results - page 53 / 77
» Join operations in temporal databases
Sort
View
DASFAA
2009
IEEE
152views Database» more  DASFAA 2009»
15 years 4 months ago
Predicting Timing Failures in Web Services
Abstract. Web services are increasingly being used in business critical environments, enabling uniform access to services provided by distinct parties. In these environments, an op...
Nuno Laranjeiro, Marco Vieira, Henrique Madeira
VLDB
1997
ACM
126views Database» more  VLDB 1997»
15 years 1 months ago
Dynamic Memory Adjustment for External Mergesort
Sorting is a memory intensive operation whose performance is greatly affected by the amount of memory available as work space. When the input size is unknown or available memory s...
Weiye Zhang, Per-Åke Larson
ICDE
2006
IEEE
156views Database» more  ICDE 2006»
15 years 11 months ago
Reasoning About Approximate Match Query Results
Join techniques deploying approximate match predicates are fundamental data cleaning operations. A variety of predicates have been utilized to quantify approximate match in such o...
Sudipto Guha, Nick Koudas, Divesh Srivastava, Xiao...
SIGMOD
2001
ACM
136views Database» more  SIGMOD 2001»
15 years 9 months ago
Selectivity Estimation using Probabilistic Models
Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query...
Lise Getoor, Benjamin Taskar, Daphne Koller
179
Voted
ICDE
2009
IEEE
144views Database» more  ICDE 2009»
15 years 11 months ago
Reachability Indexes for Relational Keyword Search
Due to its considerable ease of use, relational keyword search (R-KWS) has become increasingly popular. Its simplicity, however, comes at the cost of intensive query processing. Sp...
Alexander Markowetz, Yin Yang, Dimitris Papadias