Sciweavers

6274 search results - page 9 / 1255
» From query complexity to computational complexity
Sort
View
SIGMOD
2000
ACM
161views Database» more  SIGMOD 2000»
14 years 2 months ago
Answering Complex SQL Queries Using Automatic Summary Tables
We investigate the problem of using materialized views to answer SQL queries. We focus on modern decision-support queries, which involve joins, arithmetic operations and other (po...
Markos Zaharioudakis, Roberta Cochrane, George Lap...
FOCS
1998
IEEE
14 years 2 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello
EMNLP
2008
13 years 11 months ago
Selecting Sentences for Answering Complex Questions
Complex questions that require inferencing and synthesizing information from multiple documents can be seen as a kind of topicoriented, informative multi-document summarization. I...
Yllias Chali, Shafiq R. Joty
DEXA
2004
Springer
161views Database» more  DEXA 2004»
14 years 3 months ago
Computing the Topological Relationship of Complex Regions
Topological predicates between spatial objects have always been a main area of research on spatial data handling, reasoning, and query languages. The focus of research has definit...
Markus Schneider
PODC
2005
ACM
14 years 3 months ago
Routing complexity of faulty networks
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder