54 search results - page 8 / 11 » Cost based plan selection for xpath |
ICDE
2005
IEEE
14 years 1 months ago
2005
IEEE
Current federated systems deploy cost-based query optimization mechanisms; i.e., the optimizer selects a global query plan with the lowest cost to execute. Thus, cost functions in...
IEEECIT
2007
IEEE
14 years 2 months ago
2007
IEEE
The User requirements of many web-based services are dynamically and continuously changing even during the service time itself. For that reason, web service companies always keep ...
ICDE
2010
IEEE
14 years 7 months ago
2010
IEEE
With the total energy consumption of computing systems increasing in a steep rate, much attention has been paid to the design of energy-efficient computing systems and applications...
EDBT
2004
ACM
14 years 7 months ago
2004
ACM
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
SSDBM
2003
IEEE
14 years 29 days ago
2003
IEEE
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existin...