Sciweavers

44 search results - page 7 / 9
» Algebraic Rewritings for Optimizing Regular Path Queries
Sort
View
ER
2010
Springer
164views Database» more  ER 2010»
13 years 5 months ago
Querying Databases with Taxonomies
Traditional information search in which queries are posed against a known and rigid schema over a structured database is shifting towards a Web scenario in which exposed schemas ar...
Davide Martinenghi, Riccardo Torlone
SIGMOD
2009
ACM
201views Database» more  SIGMOD 2009»
14 years 7 months ago
Cost based plan selection for xpath
We present a complete XPath cost-based optimization and execution framework and demonstrate its effectiveness and efficiency for a variety of queries and datasets. The framework i...
Haris Georgiadis, Minas Charalambides, Vasilis Vas...
ICLP
1995
Springer
13 years 11 months ago
A Method for Implementing Equational Theories as Logic Programs
Equational theories underly many elds of computing, including functional programming, symbolic algebra, theorem proving, term rewriting and constraint solving. In this paper we sh...
Mantis H. M. Cheng, Douglas Stott Parker Jr., Maar...
ICDE
2005
IEEE
101views Database» more  ICDE 2005»
14 years 1 months ago
Optimization of Nested XQuery Expressions with Orderby Clauses
— XQuery, the defacto XML query language, is a functional language with operational semantics, which precludes the direct application of classical query optimization techniques. ...
Song Wang, Elke A. Rundensteiner, Murali Mani
ICDE
2008
IEEE
191views Database» more  ICDE 2008»
14 years 8 months ago
An Algebraic Approach to Rule-Based Information Extraction
Traditional approaches to rule-based information extraction (IE) have primarily been based on regular expression grammars. However, these grammar-based systems have difficulty scal...
Frederick Reiss, Sriram Raghavan, Rajasekar Krishn...