329 search results - page 53 / 66 » Efficient Parallel Query Processing by Graph Ranking |
ICMCS
2007
IEEE
14 years 1 months ago
2007
IEEE
In recent years, some computer vision algorithms such as SIFT (Scale Invariant Feature Transform) have been employed in image similarity match to perform image-based search applic...
SIGMOD
2009
ACM
14 years 7 months ago
2009
ACM
The ParAccel Analytic DatabaseTM is a fast shared-nothing parallel relational database system with a columnar orientation, adaptive compression, memory-centric design, and an enha...
TIP
2010
13 years 2 months ago
2010
In this paper, we present a fast algorithm for filling unknown regions in an image using the strategy of exemplarmatching. Unlike the original exemplar-based method using exhaustiv...
SIGMOD
2010
ACM
14 years 5 days 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...
VLDB
2002
ACM
14 years 7 months ago
2002
ACM
: Purpose ? Tree pattern is at the core of XML queries. The tree patterns in XML queries typically contain redundancies, especially when broad integrity constraints (ICs) are prese...