Sciweavers

3741 search results - page 532 / 749
» Monitoring Database Objects
Sort
View
PODS
1998
ACM
152views Database» more  PODS 1998»
15 years 10 months ago
A Cost Model for Similarity Queries in Metric Spaces
We consider the problem of estimating CPU (distance computations) and I/O costs for processing range and k-nearest neighbors queries over metric spaces. Unlike the specific case ...
Paolo Ciaccia, Marco Patella, Pavel Zezula
ICCS
1994
Springer
15 years 10 months ago
UDS: A Universal Data Structure
This paper gives a data structure (UDS) for supporting database retrieval, inference and machine learning that attempts to unify and extend previous work in relational databases, ...
Robert Levinson
ADBIS
2009
Springer
162views Database» more  ADBIS 2009»
15 years 10 months ago
Efficient Set Similarity Joins Using Min-prefixes
Identification of all objects in a dataset whose similarity is not less than a specified threshold is of major importance for management, search, and analysis of data. Set similari...
Leonardo Ribeiro, Theo Härder
VLDB
1997
ACM
170views Database» more  VLDB 1997»
15 years 10 months ago
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
A new access method, called M-tree, is proposed to organize and search large data sets from a generic "metric space", i.e. where object proximity is only defined by a di...
Paolo Ciaccia, Marco Patella, Pavel Zezula
VLDB
1995
ACM
103views Database» more  VLDB 1995»
15 years 10 months ago
Querying Shapes of Histories
We present a shape definition language, called SDC, for retrieving objects based on shapes contained in the histories associated with these objects. It is a small, yet powerful, l...
Rakesh Agrawal, Giuseppe Psaila, Edward L. Wimmers...