Sciweavers

329 search results - page 19 / 66
» Efficient Parallel Query Processing by Graph Ranking
Sort
View
ESCIENCE
2007
IEEE
14 years 9 days ago
A Scalable and Efficient Prefix-Based Lookup Mechanism for Large-Scale Grids
Data sources, storage, computing resources and services are entities on Grids that require mechanisms for publication and lookup. A discovery service relies on efficient lookup to...
Philip Chan, David Abramson
APPINF
2003
13 years 9 months ago
Fast Recursive Data Processing in Graphs using Reduction
This paper presents an algorithm for recursive data processing in directed graphs. The proposed algorithm applies graph reduction in order to determine both starting points and a ...
J. H. ter Bekke, J. A. Bakker
WWW
2005
ACM
14 years 9 months ago
Object-level ranking: bringing order to Web objects
In contrast with the current Web search methods that essentially do document-level ranking and retrieval, we are exploring a new paradigm to enable Web search at the object level....
Zaiqing Nie, Yuanzhi Zhang, Ji-Rong Wen, Wei-Ying ...
CIKM
2009
Springer
14 years 3 months ago
SPIDER: a system for scalable, parallel / distributed evaluation of large-scale RDF data
RDF is a data model for representing labeled directed graphs, and it is used as an important building block of semantic web. Due to its flexibility and applicability, RDF has bee...
Hyunsik Choi, Jihoon Son, YongHyun Cho, Min Kyoung...
ICDE
2002
IEEE
163views Database» more  ICDE 2002»
14 years 9 months ago
Keyword Searching and Browsing in Databases using BANKS
With the growth of the Web, there has been a rapid increase in the number of users who need to access online databases without having a detailed knowledge of the schema or of quer...
Gaurav Bhalotia, Arvind Hulgeri, Charuta Nakhe, So...