Sciweavers

265 search results - page 8 / 53
» Logical Queries over Views: Decidability and Expressiveness
Sort
View
CSL
2006
Springer
14 years 10 months ago
Automata and Logics for Words and Trees over an Infinite Alphabet
In a data word or a data tree each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been considered in the realm of sem...
Luc Segoufin
LICS
2002
IEEE
15 years 3 months ago
Monadic Queries over Tree-Structured Data
Monadic query languages over trees currently receive considerable interest in the database community, as the problem of selecting nodes from a tree is the most basic and widesprea...
Georg Gottlob, Christoph Koch
AAAI
2008
15 years 13 days ago
Worst-case Optimal Conjunctive Query Answering for an Expressive Description Logic without Inverses
Answering conjunctive queries (CQs) has been recognized as a key task for the usage of Description Logics (DLs) in a number of applications, and has thus been studied by many auth...
Magdalena Ortiz, Mantas Simkus, Thomas Eiter
PODS
1998
ACM
116views Database» more  PODS 1998»
15 years 2 months ago
Complexity of Answering Queries Using Materialized Views
We study the complexity of the problem of answering queries using materialized views. This problem has attracted a lot of attention recently because of its relevance in data integ...
Serge Abiteboul, Oliver M. Duschka
VLDB
2001
ACM
168views Database» more  VLDB 2001»
15 years 10 months ago
Answering queries using views: A survey
The problem of answering queries using views is to find efficient methods of answering a query using a set of previously materialized views over the database, rather than accessin...
Alon Y. Halevy