Sciweavers

5954 search results - page 188 / 1191
» Querying Bi-level Information
Sort
View
AMW
2010
15 years 7 months ago
Query Rewriting under Non-Guarded Rules
We address the problem of answering conjunctive queries over knowledge bases, specified by sets of first-order sentences called tuple-generating dependencies (TGDs). This problem i...
Andrea Calì, Georg Gottlob, Andreas Pieris
SIGMOD
2007
ACM
111views Database» more  SIGMOD 2007»
16 years 6 months ago
Query relaxation using malleable schemas
In contrast to classical databases and IR systems, real-world information systems have to deal increasingly with very vague and diverse structures for information management and s...
Xuan Zhou, Julien Gaugaz, Wolf-Tilo Balke, Wolfgan...
ICDE
2007
IEEE
128views Database» more  ICDE 2007»
16 years 7 months ago
SQL Queries Over Unstructured Text Databases
Text documents often embed data that is structured in nature. By processing a text database with information extraction systems, we can define a variety of structured "relati...
Alpa Jain, AnHai Doan, Luis Gravano
180
Voted
EDBT
2008
ACM
136views Database» more  EDBT 2008»
15 years 8 months ago
Dealing with P2P semantic heterogeneity through query expansion and interpretation
In P2P systems where query initiators and information providers do not necessarily share the same ontology, semantic interoperability generally relies on ontology matching or sche...
Anthony Ventresque, Sylvie Cazalens, Philippe Lama...
SIGIR
2004
ACM
15 years 11 months ago
Implicit queries (IQ) for contextualized search
The Implicit Query (IQ) prototype is a system which automatically generates context-sensitive searches based on a user’s current computing activities. In the demo, we show IQ ru...
Susan T. Dumais, Edward Cutrell, Raman Sarin, Eric...