1709 search results - page 67 / 342 » Comparing the Performance of Database Selection Algorithms |
213
Voted
SIGMOD
2009
ACM
16 years 2 months ago
2009
ACM
We present a complete XPath cost-based optimization and execution framework and demonstrate its effectiveness and efficiency for a variety of queries and datasets. The framework i...
107
click to vote
RTSS
2005
IEEE
15 years 8 months ago
2005
IEEE
The design phase of any real-time system requires balancing the limited computational resources against the functional requirements and the performance of the application. The opt...
137
Voted
ICMCS
2009
IEEE
15 years 11 days ago
2009
IEEE
We explore the problem of rapid automatic semantic tagging of video frames of unstructured (unedited) videos. We apply the Sort-Merge algorithm for feature selection on a large (&...
110
Voted
VLDB
1994
ACM
15 years 6 months ago
1994
ACM
The performance of data-parallel algorithms for spatial operations using data-parallel variants of the bucket PMR quadtree, R-tree, and R+-tree spatial data structures is compared...
137
Voted
MM
2004
ACM
15 years 8 months ago
2004
ACM
We present a method for searching databases of symbolically represented polyphonic music that exploits advantages of transportation distances such as continuity and partial matchi...