Sciweavers

492 search results - page 29 / 99
» Computing aggregations in database query languages
Sort
View
PODS
2000
ACM
102views Database» more  PODS 2000»
14 years 2 months ago
Linear Approximation of Planar Spatial Databases Using Transitive-Closure Logic
We consider spatial databases in the plane that can be defined by polynomial constraint formulas. Motivated by applications in geographic information systems, we investigate line...
Floris Geerts, Bart Kuijpers
ICDT
1997
ACM
138views Database» more  ICDT 1997»
14 years 2 months ago
Tractable Iteration Mechanisms for Bag Languages
Abstract. The goal of this paper is to study tractable iteration mechanisms for bags. The presence of duplicates in bags prevents iteration mechanisms developed in the context of s...
Latha S. Colby, Leonid Libkin
AIR
2006
124views more  AIR 2006»
13 years 10 months ago
Expressiveness of temporal query languages: on the modelling of intervals, interval relationships and states
Abstract Storing and retrieving time-related information are important, or even critical, tasks on many areas of Computer Science (CS) and in particular for Artificial Intelligence...
Rodolfo Sabás Gómez, Juan Carlos Aug...
ICDT
1997
ACM
97views Database» more  ICDT 1997»
14 years 2 months ago
Queries and Computation on the Web
The paper introduces a model of the Web as an in nite, semistructured set of objects. We reconsider the classical notions of genericity and computability of queries in this new con...
Serge Abiteboul, Victor Vianu
PODS
2006
ACM
98views Database» more  PODS 2006»
14 years 10 months ago
Processing queries on tree-structured data efficiently
This is a survey of algorithms, complexity results, and general solution techniques for efficiently processing queries on tree-structured data. I focus on query languages that com...
Christoph Koch