Sciweavers

1588 search results - page 118 / 318
» Consistent query answering in databases
Sort
View
SIGMOD
2004
ACM
121views Database» more  SIGMOD 2004»
16 years 4 months ago
An Optimal Algorithm for Querying Tree Structures and its Applications in Bioinformatics
Trees and graphs are widely used to model biological databases. Providing efficient algorithms to support tree-based or graph-based querying is therefore an important issue. In th...
Hsiao-Fei Liu, Ya-Hui Chang, Kun-Mao Chao
MFDBS
1989
102views Database» more  MFDBS 1989»
15 years 8 months ago
Transitive Closure and the LOGA+-Strategy for its Efficient Evaluation
One of the key problems when extending relational database query languages to include deductive capabilities, is to provide them with efficient methods for answering recursive que...
W. Yan, Nelson Mendonça Mattos
CAISE
2005
Springer
15 years 10 months ago
Query Processing Using Ontologies
Abstract. Recently, the database and AI research communities have paid increased attention to ontologies. The main motivating reason is that ontologies promise solutions for comple...
Chokri Ben Necib, Johann Christoph Freytag
EDBT
2004
ACM
132views Database» more  EDBT 2004»
16 years 4 months ago
Query-Customized Rewriting and Deployment of DB-to-XML Mappings
Given the current trend towards application interoperability and XML-based data integration, there is an increasing need for XML interfaces to relational database management system...
Oded Shmueli, George A. Mihaila, Sriram Padmanabha...
ICDE
2010
IEEE
171views Database» more  ICDE 2010»
16 years 4 months ago
Surrogate Ranking for Very Expensive Similarity Queries
1 We consider the problem of similarity search in applications where the cost of computing the similarity between two records is very expensive, and the similarity measure is not a...
Chris Jermaine, Fei Xu, Mingxi Wu, Ravi Jampani, T...