Sciweavers

163 search results - page 5 / 33
» Supporting ranked search in parallel search cluster networks
Sort
View
EDBT
2011
ACM
256views Database» more  EDBT 2011»
14 years 9 months ago
RanKloud: a scalable ranked query processing framework on hadoop
The popularity of batch-oriented cluster architectures like Hadoop is on the rise. These batch-based systems successfully achieve high degrees of scalability by carefully allocati...
K. Selçuk Candan, Parth Nagarkar, Mithila N...
PDP
2008
IEEE
16 years 12 days ago
Load Balancing Distributed Inverted Files: Query Ranking
Search engines use inverted files as index data structures to speed up the solution of user queries. The index is distributed on a set of processors forming a cluster of computer...
Carlos Gomez-Pantoja, Mauricio Marín
ICDCSW
2005
IEEE
15 years 11 months ago
Cluster-Based Intelligent Searching in Unstructured Peer-to-Peer Networks
Existing cluster-based searching schemes in unstructured peer-to-peer (P2P) networks employ flooding/random forwarding on connected dominating sets (CDS) of networks. There exist...
Xiuqi Li, Jie Wu
ICPP
2007
IEEE
16 years 10 days ago
Difficulty-aware Hybrid Search in Peer-to-Peer Networks
—By combining an unstructured protocol with a DHT-based global index, hybrid peer-to-peer (P2P) improves search efficiency in terms of query recall and response time. The major c...
Hanhua Chen, Hai Jin, Yunhao Liu, Lionel M. Ni
ICPADS
2005
IEEE
15 years 11 months ago
An Efficient Partition-Based Parallel PageRank Algorithm
PageRank becomes the most well-known re-ranking technique of the search results. By its iterative computational nature, the computation takes much computing time and resource. Res...
Bundit Manaskasemsak, Arnon Rungsawang