Sciweavers

189 search results - page 10 / 38
» Approximating predicates and expressive queries on probabili...
Sort
View
XSYM
2004
Springer
115views Database» more  XSYM 2004»
14 years 2 months ago
XQuery Processing with Relevance Ranking
Abstract. We are presenting a coherent framework for XQuery processing that incorporates IR-style approximate matching and allows the ordering of results by their relevance score. ...
Leonidas Fegaras
EDBTW
2006
Springer
14 years 9 days ago
Models for Incomplete and Probabilistic Information
Abstract. We discuss, compare and relate some old and some new models for incomplete and probabilistic databases. We characterize the expressive power of c-tables over infinite dom...
Todd J. Green, Val Tannen
SIGMOD
2010
ACM
149views Database» more  SIGMOD 2010»
13 years 3 months ago
On models and query languages for probabilistic processes
Probabilistic processes appear naturally in various contexts, with applications to Business Processes, XML data management and more. Many models for specifying and querying such p...
Daniel Deutch, Tova Milo
XSYM
2004
Springer
129views Database» more  XSYM 2004»
14 years 2 months ago
Fractional XSketch Synopses for XML Databases
A key step in the optimization of declarative queries over XML data is estimating the selectivity of path expressions, i.e., the number of elements reached by a specific navigatio...
Natasha Drukh, Neoklis Polyzotis, Minos N. Garofal...
DEXAW
1999
IEEE
168views Database» more  DEXAW 1999»
14 years 29 days ago
Using the Distance Distribution for Approximate Similarity Queries in High-Dimensional Metric Spaces
We investigate the problem of approximate similarity (nearest neighbor) search in high-dimensional metric spaces, and describe how the distance distribution of the query object ca...
Paolo Ciaccia, Marco Patella