197 search results - page 29 / 40 » Efficiently approximating query optimizer plan diagrams |
SIGMOD
2007
ACM
14 years 7 months ago
2007
ACM
Suppose a long-running analytical query is executing on a database server and has been allocated a large amount of physical memory. A high-priority task comes in and we need to ru...
IJRR
2007
13 years 7 months ago
2007
Efficient algorithms for collision-free energy sub-optimal path planning for formations of spacecraft flying in deep space are presented. The idea is to introduce a set of way-poi...
GIS
2008
ACM
14 years 8 months ago
2008
ACM
Trip planning search (TPS) represents an important class of queries in Geographic Information Systems (GIS). In many real-world applications, TPS requests are issued with a number...
VLDB
2002
ACM
13 years 7 months ago
2002
ACM
Star queries are the most prevalent kind of queries in data warehousing, OLAP and business intelligence applications. Thus, there is an imperative need for efficiently processing ...
VLDB
1995
ACM
13 years 11 months ago
1995
ACM
Query processing is one of the most, critical issues in Object-Oriented DBMSs. Extensible opt,imizers with efficient, search strategies require a cost model to select the most eff...