Sciweavers

995 search results - page 69 / 199
» Optimization of Complex Nested Queries in Relational Databas...
Sort
View
VLDB
2003
ACM
141views Database» more  VLDB 2003»
16 years 2 months ago
Computing complete answers to queries in the presence of limited access patterns
In data applications such as information integration, there can be limited access patterns to relations, i.e., binding patterns require values to be specified for certain attribut...
Chen Li
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
13 years 4 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
ICTAI
2008
IEEE
15 years 8 months ago
Answering Complex Questions Using Query-Focused Summarization Technique
Unlike simple questions, complex questions cannot be answered by simply extracting named entities. These questions require inferencing and synthesizing information from multiple d...
Yllias Chali, Shafiq R. Joty
WEBDB
2000
Springer
136views Database» more  WEBDB 2000»
15 years 5 months ago
An Optimization Technique for Answering Regular Path Queries
Rewriting queries using views is a powerful technique that has applications in data integration, data warehousing and query optimization. Query rewriting in relational databases i...
Gösta Grahne, Alex Thomo
ICDE
2002
IEEE
104views Database» more  ICDE 2002»
16 years 3 months ago
Efficient Evaluation of Queries with Mining Predicates
Modern relational database systems are beginning to support ad hoc queries on mining models. In this paper, we explore novel techniques for optimizing queries that apply mining mo...
Surajit Chaudhuri, Vivek R. Narasayya, Sunita Sara...