Sciweavers

189 search results - page 13 / 38
» Approximating predicates and expressive queries on probabili...
Sort
View
ACTA
2002
111views more  ACTA 2002»
13 years 8 months ago
Adding a path connectedness operator to FO+poly (linear)
In the constraint database community, FO+poly and FO+linear have been proposed as foundations for spatial database query languages. One of the strengths of this approach is that t...
Chris Giannella, Dirk Van Gucht
IH
2007
Springer
14 years 2 months ago
Software Integrity Checking Expressions (ICEs) for Robust Tamper Detection
Abstract. We introduce software integrity checking expressions (SoftICEs), which are program predicates that can be used in software tamper detection. We present two candidates, pr...
Mariusz H. Jakubowski, Prasad Naldurg, Vijay Patan...
SIGMOD
2007
ACM
169views Database» more  SIGMOD 2007»
14 years 8 months ago
Scalable approximate query processing with the DBO engine
This paper describes query processing in the DBO database system. Like other database systems designed for ad-hoc, analytic processing, DBO is able to compute the exact answer to ...
Christopher M. Jermaine, Subramanian Arumugam, Abh...
FOIKS
2004
Springer
14 years 2 months ago
Query Answering and Containment for Regular Path Queries under Distortions
Abstract. We give a general framework for approximate query processing in semistructured databases. We focus on regular path queries, which are the integral part of most of the que...
Gösta Grahne, Alex Thomo
ICDE
2007
IEEE
134views Database» more  ICDE 2007»
14 years 10 months ago
Efficient Top-k Query Evaluation on Probabilistic Data
Modern enterprise applications are forced to deal with unreliable, inconsistent and imprecise information. Probabilistic databases can model such data naturally, but SQL query eva...
Christopher Re, Nilesh N. Dalvi, Dan Suciu