995 search results - page 100 / 199 » Optimization of Complex Nested Queries in Relational Databas... |
138
click to vote
SSDBM
2003
IEEE
15 years 8 months ago
2003
IEEE
String data is ubiquitous, and its management has taken on particular importance in the past few years. Approximate queries are very important on string data especially for more c...
152
click to vote
ICIW
2008
IEEE
15 years 9 months ago
2008
IEEE
—With the increasing development of real applications using Semantic Web Technologies, it is necessary to provide scalable and efficient ontology querying and reasoning systems....
141
click to vote
EDBT
2004
ACM
16 years 3 months ago
2004
ACM
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...
118
click to vote
IDEAS
2007
IEEE
15 years 9 months ago
2007
IEEE
In this paper we study the problem of deciding whether a regular path query over views in data-integration systems can be re-expressed without recursion. The problem becomes chall...
166
click to vote
PODS
1994
ACM
15 years 7 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...