Sciweavers

342 search results - page 20 / 69
» Conjunctive Queries over Trees
Sort
View
JOLLI
2010
94views more  JOLLI 2010»
13 years 6 months ago
Querying Linguistic Trees
Large databases of linguistic annotations are used for testing linguistic hypotheses and for training language processing models. These linguistic annotations are often syntactic ...
Catherine Lai, Steven Bird
ADBIS
2004
Springer
93views Database» more  ADBIS 2004»
14 years 1 months ago
Query Rewriting Using Views in a Typed Mediator Environment
Abstract. Query rewriting method is proposed for the heterogeneous information integration infrastructure formed by the subject mediator environment. Local as View (LAV) approach t...
Leonid A. Kalinichenko, Dmitry O. Martynov, Sergey...
SPIRE
2009
Springer
14 years 2 months ago
Two-Dimensional Distributed Inverted Files
Abstract. Term-partitioned indexes are generally inefficient for the evaluation of conjunctive queries, as they require the communication of long posting lists. On the other side, ...
Esteban Feuerstein, Mauricio Marín, Michel ...
ICDT
2011
ACM
242views Database» more  ICDT 2011»
12 years 11 months ago
Knowledge compilation meets database theory: compiling queries to decision diagrams
The goal of Knowledge Compilation is to represent a Boolean expression in a format in which it can answer a range of online-queries in PTIME. The online-query of main interest to ...
Abhay Kumar Jha, Dan Suciu
LICS
2002
IEEE
14 years 20 days ago
Tree Extension Algebras: Logics, Automata, and Query Languages
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
Michael Benedikt, Leonid Libkin