390 search results - page 69 / 78 » Approximate Query Answering in Locally Closed Databases |
136
Voted
CIDR
2003
15 years 5 months ago
2003
It has frequently been observed that most of the world’s data lies outside database systems. The reason is that database systems focus on structured data, leaving the unstructur...
116
Voted
SIGMOD
2001
ACM
16 years 3 months ago
2001
ACM
Approximating the joint data distribution of a multi-dimensional data set through a compact and accurate histogram synopsis is a fundamental problem arising in numerous practical ...
131
Voted
CIKM
2005
Springer
15 years 9 months ago
2005
Springer
Accurately and efficiently estimating the number of distinct values for some attribute(s) or sets of attributes in a data set is of critical importance to many database operation...
153
Voted
CIKM
2010
Springer
15 years 2 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
252
Voted
SIGMOD
2009
ACM
16 years 3 months ago
2009
ACM
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...