Sciweavers

63 search results - page 12 / 13
» Exploiting Common Subexpressions for Cloud Query Processing
Sort
View
SC
2004
ACM
13 years 11 months ago
Big Wins with Small Application-Aware Caches
Large datasets, on the order of GB and TB, are increasingly common as abundant computational resources allow practitioners to collect, produce and store data at higher rates. As d...
Julio C. López, David R. O'Hallaron, Tianka...
ARCS
2004
Springer
13 years 11 months ago
Latent Semantic Indexing in Peer-to-Peer Networks
Searching in decentralized peer-to-peer networks is a challenging problem. In common applications such as Gnutella, searching is performed by randomly forwarding queries to all pee...
Xuezheng Liu, Ming Chen, Guangwen Yang
SSDBM
2003
IEEE
136views Database» more  SSDBM 2003»
13 years 11 months ago
Acceleration of Relational Index Structures Based on Statistics
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existin...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
PVLDB
2010
204views more  PVLDB 2010»
13 years 4 months ago
Cheetah: A High Performance, Custom Data Warehouse on Top of MapReduce
Large-scale data analysis has become increasingly important for many enterprises. Recently, a new distributed computing paradigm, called MapReduce, and its open source implementat...
Songting Chen
ICDM
2008
IEEE
186views Data Mining» more  ICDM 2008»
14 years 6 days ago
xCrawl: A High-Recall Crawling Method for Web Mining
Web Mining Systems exploit the redundancy of data published on the Web to automatically extract information from existing web documents. The first step in the Information Extract...
Kostyantyn M. Shchekotykhin, Dietmar Jannach, Gerh...