610 search results - page 48 / 122 » Efficient Query Evaluation on Probabilistic Databases |
227
Voted
ICDE
2001
IEEE
16 years 1 months ago
2001
IEEE
In this paper, we develop a general framework for approximate nearest neighbor queries. We categorize the current approaches for nearest neighbor query processing based on either ...
209
click to vote
ICDE
2003
IEEE
16 years 1 months ago
2003
IEEE
XML documents are typically queried with a combination of value search and structure search. While querying by values can leverage traditional database technologies, evaluating st...
167
click to vote
SIGMOD
2007
ACM
16 years 21 days ago
2007
ACM
This paper investigates a class of transform queries proposed by XQuery Update [6]. A transform query is defined in terms of XML update syntax. When posed on an XML tree T, it ret...
117
Voted
DASFAA
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract. In many application domains, e.g. sensor databases, traffic management or recognition systems, objects have to be compared based on positionally and existentially uncert...
177
Voted
GIS
2006
ACM
16 years 1 months ago
2006
ACM
We give two efficient on-line algorithms to simplify weighted graphs by eliminating degree-two vertices. Our algorithms are on-line -- they react to updates on the data, keeping t...