Sciweavers

528 search results - page 58 / 106
» The Similarity Join Database Operator
Sort
View
VLDB
1998
ACM
120views Database» more  VLDB 1998»
15 years 2 months ago
Algorithms for Querying by Spatial Structure
: Structural queries constitute a special form of content-basedretrieval where the user specifiesa set of spatial constraints among query variables and asks for all configurations ...
Dimitris Papadias, Nikos Mamoulis, Vasilis Delis
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
FOIKS
2004
Springer
15 years 3 months ago
Plan Databases: Model and Algebra
Despite the fact that thousands of applications manipulate plans, there has been no work to date on managing large databases of plans. In this paper, we first propose a formal mod...
Fusun Yaman, Sibel Adali, Dana S. Nau, Maria Luisa...
SIGMOD
2001
ACM
136views Database» more  SIGMOD 2001»
15 years 10 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
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