430 search results - page 11 / 86 » An Efficient Parallel Join Algorithm Based On Hypercube-Part... |
176
click to vote
ICDE
2009
IEEE
16 years 1 months ago
2009
IEEE
We consider the problem of efficiently computing weighted proximity best-joins over multiple lists, with applications in information retrieval and extraction. We are given a multi-...
163
click to vote
SIGMOD
2007
ACM
15 years 11 months ago
2007
ACM
Commercial enterprise data warehouses are typically implemented on parallel databases due to the inherent scalability and performance limitation of a serial architecture. Queries ...
115
click to vote
DATESO
2008
15 years 1 months ago
2008
Abstract In recent years, many approaches to indexing XML data have appeared. These approaches attempt to process XML queries efficiently and sufficient query plans are built for t...
111
click to vote
ITIIS
2010
14 years 6 months ago
2010
Rapid growth of internet applications has increased the importance of intrusion detection system (IDS) performance. String matching is the most computation-consuming task in IDS. ...
DASFAA
2007
IEEE
15 years 3 months ago
2007
IEEE
Label stream partition is a useful technique to reduce the input I/O cost of holistic twig join by pruning useless streams beforehand. The Prefix Path Stream (PPS) partition scheme...