Sciweavers

382 search results - page 24 / 77
» Ranking Approximate Answers to Semantic Web Queries
Sort
View
WAW
2007
Springer
77views Algorithms» more  WAW 2007»
14 years 2 months ago
Using Bloom Filters to Speed Up HITS-Like Ranking Algorithms
Abstract. This paper describes a technique for reducing the querytime cost of HITS-like ranking algorithm. The basic idea is to compute for each node in the web graph a summary of ...
Sreenivas Gollapudi, Marc Najork, Rina Panigrahy
CIKM
2008
Springer
13 years 10 months ago
A language for manipulating clustered web documents results
We propose a novel conception language for exploring the results retrieved by several internet search services (like search engines) that cluster retrieved documents. The goal is ...
Gloria Bordogna, Alessandro Campi, Giuseppe Psaila...
SEMWEB
2009
Springer
14 years 1 months ago
A Decomposition-Based Approach to Optimizing Conjunctive Query Answering in OWL DL
Scalable query answering over Description Logic (DL) based ontologies plays an important role for the success of the Semantic Web. Towards tackling the scalability problem, we prop...
Jianfeng Du, Guilin Qi, Jeff Z. Pan, Yi-Dong Shen
CIKM
2008
Springer
13 years 10 months ago
CE2: towards a large scale hybrid search engine with integrated ranking support
The Web contains a large amount of documents and increasingly, also semantic data in the form of RDF triples. Many of these triples are annotations that are associated with docume...
Haofen Wang, Thanh Tran, Chang Liu
DASFAA
2009
IEEE
173views Database» more  DASFAA 2009»
14 years 16 days ago
A Uniform Framework for Ad-Hoc Indexes to Answer Reachability Queries on Large Graphs
Graph-structured databases and related problems such as reachability query processing have been increasingly relevant to many applications such as XML databases, biological databas...
Linhong Zhu, Byron Choi, Bingsheng He, Jeffrey Xu ...