Sciweavers

710 search results - page 26 / 142
» Relational Expressive Power of Constraint Query Languages
Sort
View
SIGMOD
2008
ACM
101views Database» more  SIGMOD 2008»
14 years 7 months ago
On Query Algebras for Probabilistic Databases
This article proposes a core query algebra for probabilistic databases. In essence, this core is part of the query languages of most probabilistic database systems proposed so far...
Christoph Koch
ICDE
2006
IEEE
189views Database» more  ICDE 2006»
14 years 9 months ago
Algebraic Optimization of Nested XPath Expressions
The XPath language incorporates powerful primitives for formulating queries containing nested subexpressions which are existentially or universally quantified. However, even the b...
Matthias Brantner, Carl-Christian Kanne, Guido Moe...
CIKM
2006
Springer
13 years 11 months ago
Information retrieval from relational databases using semantic queries
Relational databases are widely used today as a mechanism for providing access to structured data. They, however, are not suitable for typical information finding tasks of end use...
Anand Ranganathan, Zhen Liu
AAAI
2007
13 years 10 months ago
Answering Regular Path Queries in Expressive Description Logics: An Automata-Theoretic Approach
Expressive Description Logics (DLs) have been advocated as formalisms for modeling the domain of interest in various application areas. An important requirement is the ability to ...
Diego Calvanese, Thomas Eiter, Magdalena Ortiz
WSDM
2010
ACM
265views Data Mining» more  WSDM 2010»
14 years 5 months ago
Data-oriented Content Query System: Searching for Data into Text on the Web
As the Web provides rich data embedded in the immense contents inside pages, we witness many ad-hoc efforts for exploiting fine granularity information across Web text, such as We...
Kevin Chen-Chuan Chang, Mianwei Zhou, Tao Cheng