Sciweavers

174 search results - page 22 / 35
» Efficient Compression of Web Graphs
Sort
View
TKDE
2002
111views more  TKDE 2002»
13 years 9 months ago
Query Relaxation by Structure and Semantics for Retrieval of Logical Web Documents
Since WWW encourages hypertext and hypermedia document authoring (e.g. HTML or XML), Web authors tend to create documents that are composed of multiple pages connected with hyperl...
Wen-Syan Li, K. Selçuk Candan, Quoc Vu, Div...
WISE
2009
Springer
14 years 7 months ago
Entry Pairing in Inverted File
Abstract. This paper proposes to exploit content and usage information to rearrange an inverted index for a full-text IR system. The idea is to merge the entries of two frequently ...
Hoang Thanh Lam, Raffaele Perego, Nguyen Thoi Minh...
WWW
2010
ACM
14 years 4 months ago
Matrix "Bit" loaded: a scalable lightweight join query processor for RDF data
The Semantic Web community, until now, has used traditional database systems for the storage and querying of RDF data. The SPARQL query language also closely follows SQL syntax. A...
Medha Atre, Vineet Chaoji, Mohammed J. Zaki, James...
TREC
2008
13 years 11 months ago
Weighted PageRank: Cluster-Related Weights
PageRank is a way to rank Web pages taking into account hyper-link structure of the Web. PageRank provides efficient and simple method to find out ranking of Web pages exploiting ...
Danil Nemirovsky, Konstantin Avrachenkov
SIGMOD
2009
ACM
182views Database» more  SIGMOD 2009»
14 years 10 months ago
3-HOP: a high-compression indexing scheme for reachability query
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...
Ruoming Jin, Yang Xiang, Ning Ruan, David Fuhry