2514 search results - page 57 / 503 » On the Computation of Approximations of Database Queries |
151
click to vote
ACMSE
2005
ACM
15 years 12 months ago
2005
ACM
A simple extension to the relational model that permits metadata (more generally metaknowledge) to be stored and manipulated as first class data is proposed. The accompanying que...
275
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
Many scientific, financial, data mining and sensor network applications need to work with continuous, rather than discrete data e.g., temperature as a function of location, or sto...
126
click to vote
EDBT
2008
ACM
16 years 6 months ago
2008
ACM
Users often do not require a complete answer to their query but rather only a sample. They expect the sample to be either the largest possible or the most representative (or both)...
191
click to vote
WAIM
2010
Springer
15 years 4 months ago
2010
Springer
Keyword search in relational databases has been widely studied in recent years. Most of the previous studies focus on how to answer an instant keyword query. In this paper, we focu...
190
click to vote
TCOS
2010
15 years 4 months ago
2010
We propose an approximation method to answer point-to-point shortest path queries in undirected edge-weighted graphs, based on random sampling and Voronoi duals. We compute a simp...