Sciweavers

174 search results - page 12 / 35
» Efficient Compression of Web Graphs
Sort
View
SIGCOMM
1997
ACM
14 years 2 months ago
Potential Benefits of Delta Encoding and Data Compression for HTTP
Caching in the World Wide Web currently follows a naive model, which assumes that resources are referenced many times between changes. The model also provides no way to update a c...
Jeffrey C. Mogul, Fred Douglis, Anja Feldmann, Bal...
IJSWIS
2008
135views more  IJSWIS 2008»
13 years 9 months ago
Efficient Processing of RDF Queries with Nested Optional Graph Patterns in an RDBMS
Relational technology has shown to be very useful for scalable Semantic Web data management. Numerous researchers have proposed to use RDBMSs to store and query voluminous RDF dat...
Artem Chebotko, Shiyong Lu, Mustafa Atay, Farshad ...
CIKM
2009
Springer
14 years 1 months ago
Efficient processing of group-oriented connection queries in a large graph
We study query processing in large graphs that are fundamental data model underpinning various social networks and Web structures. Given a set of query nodes, we aim to find the g...
James Cheng, Yiping Ke, Wilfred Ng
ICDE
2002
IEEE
117views Database» more  ICDE 2002»
14 years 11 months ago
Exploring Aggregate Effect with Weighted Transcoding Graphs for Efficient Cache Replacement in Transcoding Proxies
This paper explores the aggregate effect when caching multiple versions of the same Web object in the transcoding proxy. Explicitly, the aggregate profit from caching multiple ver...
Cheng-Yue Chang, Ming-Syan Chen
ICSE
2004
IEEE-ACM
14 years 10 months ago
Using Compressed Bytecode Traces for Slicing Java Programs
Dynamic slicing is a well-known program debugging technique. Given a program P and input I, it finds all program statements which directly/indirectly affect the values of some var...
Tao Wang, Abhik Roychoudhury