2514 search results - page 97 / 503 » On the Computation of Approximations of Database Queries |
219
click to vote
FAW
2010
Springer
15 years 6 months ago
2010
Springer
We study the minimum diameter color-spanning set problem which has recently drawn some attention in the database community. We show that the problem can be solved in polynomial tim...
154
click to vote
ADC
2008
Springer
16 years 22 days ago
2008
Springer
Several XML query languages have been proposed that use XPath expressions to locate data. But XPath expressions might miss some data because of irregularities in the data and sche...
196
click to vote
ICDT
2003
ACM
15 years 11 months ago
2003
ACM
Abstract. Repairing a database means bringing the database in accordance with a given set of integrity constraints by applying modifications that are as small as possible. In the ...
186
click to vote
EDBT
2010
ACM
16 years 1 months ago
2010
ACM
There are two broad approaches to query evaluation over probabilistic databases: (1) Intensional Methods proceed by manipulating expressions over symbolic events associated with u...
267
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...