Sciweavers

430 search results - page 12 / 86
» An Efficient Parallel Join Algorithm Based On Hypercube-Part...
Sort
View
WWW
2005
ACM
16 years 10 days ago
TJFast: effective processing of XML twig pattern matching
Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. A number of algorithms have been proposed to process ...
Jiaheng Lu, Ting Chen, Tok Wang Ling
IJSWIS
2008
135views more  IJSWIS 2008»
14 years 11 months ago
Efficient Processing of RDF Queries with Nested Optional Graph Patterns in an RDBMS
Relational technology has shown to be very useful for scalable Semantic Web data management. Numerous researchers have proposed to use RDBMSs to store and query voluminous RDF dat...
Artem Chebotko, Shiyong Lu, Mustafa Atay, Farshad ...
82
Voted
PODC
2009
ACM
16 years 6 days ago
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...
Riko Jacob, Andréa W. Richa, Christian Sche...
SIGMOD
2011
ACM
299views Database» more  SIGMOD 2011»
14 years 2 months ago
Processing theta-joins using MapReduce
Joins are essential for many data analysis tasks, but are not supported directly by the MapReduce paradigm. While there has been progress on equi-joins, implementation of join alg...
Alper Okcan, Mirek Riedewald
HPCC
2007
Springer
15 years 3 months ago
A Highly Efficient Parallel Algorithm for H.264 Encoder Based on Macro-Block Region Partition
This paper proposes a highly efficient MBRP parallel algorithm for H.264 encoder, which is based on the analysis of data dependencies in H.264 encoder. In the algorithm, the video ...
Shuwei Sun, Dong Wang, Shuming Chen