Sciweavers

443 search results - page 16 / 89
» Relational Approach to Logical Query Optimization of XPath
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
WEBDB
2010
Springer
208views Database» more  WEBDB 2010»
13 years 5 months ago
XML-Based RDF Data Management for Efficient Query Processing
The Semantic Web, which represents a web of knowledge, offers new opportunities to search for knowledge and information. To harvest such search power requires robust and scalable ...
Mo Zhou, Yuqing Wu
KRDB
2003
142views Database» more  KRDB 2003»
13 years 9 months ago
Optimizing Query Answering in Description Logics using Disjunctive Deductive Databases
Motivated by the possibilities of applying deductive database technology for efficient query answering in description logics, we present a translation operator µ that transforms...
Boris Motik, Raphael Volz
SIGMOD
2008
ACM
145views Database» more  SIGMOD 2008»
14 years 7 months ago
Optimizing complex queries with multiple relation instances
Today's query processing engines do not take advantage of the multiple occurrences of a relation in a query to improve performance. Instead, each instance is treated as a dis...
Yu Cao, Gopal C. Das, Chee Yong Chan, Kian-Lee Tan
LOPSTR
2004
Springer
14 years 1 months ago
Proving Termination for Logic Programs by the Query-Mapping Pairs Approach
This paper describes a method for proving termination of to logic programs based on abstract interpretation. The method ry-mapping pairs to abstract the relation between calls in t...
Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Ser...