1709 search results - page 240 / 342 » Comparing the Performance of Database Selection Algorithms |
151
Voted
SIGMOD
2010
ACM
15 years 9 months ago
2010
ACM
Time-oriented progress estimation for parallel queries is a challenging problem that has received only limited attention. In this paper, we present ParaTimer, a new type of timere...
217
click to vote
VLDB
2007
ACM
16 years 5 months ago
2007
ACM
A "plan diagram" is a pictorial enumeration of the execution plan choices of a database query optimizer over the relational selectivity space. We have shown recently tha...
165
click to vote
WWW
2010
ACM
16 years 43 min ago
2010
ACM
The World-Wide Web consists not only of a huge number of unstructured texts, but also a vast amount of valuable structured data. Web tables [2] are a typical type of structured in...
235
click to vote
GIS
2010
ACM
15 years 3 months ago
2010
ACM
The quality of a local search engine, such as Google and Bing Maps, heavily relies on its geographic datasets. Typically, these datasets are obtained from multiple sources, e.g., ...
218
click to vote
SIGMOD
2007
ACM
16 years 5 months ago
2007
ACM
This paper investigates a class of transform queries proposed by XQuery Update [6]. A transform query is defined in terms of XML update syntax. When posed on an XML tree T, it ret...