Sciweavers

3368 search results - page 3 / 674
» The Complexity of Query Reliability
Sort
View
ESA
2008
Springer
92views Algorithms» more  ESA 2008»
13 years 9 months ago
How Reliable Are Practical Point-in-Polygon Strategies?
We experimentally study the reliability of geometric software for point location in simple polygons. As expected, the code we tested works very well for random query points. Howeve...
Stefan Schirra
EDBT
2008
ACM
150views Database» more  EDBT 2008»
14 years 7 months ago
Cost-based query optimization for complex pattern mining on multiple databases
For complex data mining queries, query optimization issues arise, similar to those for the traditional database queries. However, few works have applied the cost-based query optim...
Ruoming Jin, David Fuhry, Abdulkareem Alali
PODC
2005
ACM
14 years 1 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
DEXA
2003
Springer
108views Database» more  DEXA 2003»
14 years 21 days ago
Exploiting Similarity of Subqueries for Complex Query Optimization
Query optimizers in current database management systems (DBMS) often face problems such as intolerably long optimization time and/or poor optimization results when optimizing compl...
Yingying Tao, Qiang Zhu, Calisto Zuzarte
ICDE
2006
IEEE
213views Database» more  ICDE 2006»
14 years 1 months ago
Optimization of Complex Nested Queries in Relational Databases
Due to the flexible structures of SQL, no general approach works efficiently for all kinds of queries. Some special kinds of queries can be further optimized for better performa...
Bin Cao