Sciweavers

320 search results - page 34 / 64
» A Theory of Spatio-Temporal Database Queries
Sort
View
PODS
2011
ACM
238views Database» more  PODS 2011»
12 years 10 months ago
Beyond simple aggregates: indexing for summary queries
Database queries can be broadly classified into two categories: reporting queries and aggregation queries. The former retrieves a collection of records from the database that mat...
Zhewei Wei, Ke Yi
PODS
2008
ACM
120views Database» more  PODS 2008»
14 years 7 months ago
Effective characterizations of tree logics
A survey of effective characterizations of tree logics. If L is a logic, then an effective characterization for L is an algorithm, which inputs a tree automaton and replies if the...
Mikolaj Bojanzyk
CORR
2010
Springer
138views Education» more  CORR 2010»
13 years 7 months ago
A Logical Temporal Relational Data Model
Time is one of the most difficult aspects to handle in real world applications such as database systems. Relational database management systems proposed by Codd offer very little ...
Nadeem Mahmood, Aqil Burney, Kamran Ahsan
DLOG
2008
13 years 10 months ago
Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
Answering queries posed over knowledge bases is a central problem in knowledge representation and database theory. In databases, query containment is one of the important query op...
Andrea Calì, Georg Gottlob, Michael Kifer
ICDT
2005
ACM
130views Database» more  ICDT 2005»
14 years 1 months ago
Rewriting Queries Using Views with Access Patterns Under Integrity Constraints
We study the problem of rewriting queries using views in the presence of access patterns, integrity constraints, disjunction, and negation. We provide asymptotically optimal algori...
Alin Deutsch, Bertram Ludäscher, Alan Nash