3341 search results - page 15 / 669 » On Bounded Queries and Approximation |
SIGMOD
2005
ACM
14 years 8 months ago
2005
ACM
Personalization is a powerful mechanism that helps users to cope with the abundance of information on the Web. Database query personalization achieves this by dynamically construc...
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
ADC
2006
Springer
14 years 2 months ago
2006
Springer
Many strategies for similarity search in image databases assume a metric and quadratic form-based similarity model where an optimal lower bounding distance function exists for fil...
PVLDB
2008
13 years 8 months ago
2008
In probabilistic databases, lineage is fundamental to both query processing and understanding the data. Current systems s.a. Trio or Mystiq use a complete approach in which the li...
EDBT
2009
ACM
14 years 3 months ago
2009
ACM
The largeness and the heterogeneity of most graph-modeled datasets in several database application areas make the query process a real challenge because of the lack of a complete ...