Sciweavers

3368 search results - page 85 / 674
» The Complexity of Query Reliability
Sort
View
ICDE
2008
IEEE
161views Database» more  ICDE 2008»
14 years 3 months ago
On the semantics and evaluation of top-k queries in probabilistic databases
We formulate three intuitive semantic properties for topk queries in probabilistic databases, and propose GlobalTopk query semantics which satisfies all of them. We provide a dyn...
Xi Zhang, Jan Chomicki
DAGSTUHL
2003
13 years 10 months ago
Query Answering in Inconsistent Databases
In this chapter, we summarize the research on querying inconsistent databases we have been conducting over the last five years. The formal framework we have used is based on two c...
Leopoldo E. Bertossi, Jan Chomicki
VLDB
2002
ACM
106views Database» more  VLDB 2002»
13 years 8 months ago
Efficient Algorithms for Processing XPath Queries
Our experimental analysis of several popular XPath processors reveals a striking fact: Query evaluation in each of the systems requires time exponential in the size of queries in ...
Georg Gottlob, Christoph Koch, Reinhard Pichler
CORR
2010
Springer
180views Education» more  CORR 2010»
13 years 6 months ago
Shortest path problem in rectangular complexes of global nonpositive curvature
Abstract. CAT(0) metric spaces constitute a far-reaching common generalization of Euclidean and hyperbolic spaces and simple polygons: any two points x and y of a CAT(0) metric spa...
Victor Chepoi, Daniela Maftuleac
WAIM
2010
Springer
13 years 7 months ago
Query Processing with Materialized Views in a Traceable P2P Record Exchange Framework
Materialized views which are derived from base relations and stored in the database are often used to speed up query processing. In this paper, we leverage them in a traceable peer...
Fengrong Li, Yoshiharu Ishikawa