Sciweavers

1238 search results - page 27 / 248
» View-based query containment
Sort
View
COMPGEOM
2007
ACM
15 years 1 months ago
Querying approximate shortest paths in anisotropic regions
We present a data structure for answering approximate shortest path queries in a planar subdivision from a fixed source. Let 1 be a real number. Distances in each face of this sub...
Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Ya...
EDBT
2004
ACM
155views Database» more  EDBT 2004»
15 years 9 months ago
Processing Unions of Conjunctive Queries with Negation under Limited Access Patterns
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...
Alan Nash, Bertram Ludäscher
ICDE
2007
IEEE
117views Database» more  ICDE 2007»
15 years 11 months ago
Unnesting Scalar SQL Queries in the Presence of Disjunction
Optimizing nested queries is an intricate problem. It becomes even harder if in a nested query the linking predicate or the correlation predicate occurs disjunctively. We present ...
Matthias Brantner, Norman May, Guido Moerkotte
TMRA
2005
Springer
15 years 3 months ago
tolog - A Topic Maps Query Language
Abstract. This paper describes a query algebra for tolog, a query language for Topic Maps inspired by Prolog and very similar to Datalog. The language is based on binding variables...
Lars Marius Garshol
ADBIS
2004
Springer
125views Database» more  ADBIS 2004»
15 years 3 months ago
Using XSLT Stylesheets to Transform XPath Queries
Abstract. Often, XML documents stored in an XML database must be transformed by an XSL processor into a client-specific format before queries are submitted. In applications where X...
Sven Groppe, Stefan Böttcher, Reiko Heckel, G...