快速访问的Web图压缩
Web graph compression with fast access
摘要：
近年来，研究万维网的内容成为一项非常重要但相当困难的任务。需要一种压缩技术，其将允许将web图表示放入存储器中，同时保持与访问硬盘驱动器上的未压缩web图所需的时间竞争的随机访问时间。目前已经有一些技术可以完成这一任务，但仍有改进的空间，本文试图证明这一点，并对这一领域的两种方法进行了比较（BV和k2分区）到两个已经实现的算法（然而，用C++程序设计语言重写以最大化速度和资源管理效率），它们是LM和2D，并介绍了后者的新变体，称为2D条纹。这篇论文也是一个概念的证明。最后的考虑因素显示了所有提出的方法的积极和消极方面，暴露了新的变体的可行性，以及指出未来的发展方向。
英文摘要：
In recent years studying the content of the World Wide Web became a very important yet rather difficult task. There is a need for a compression technique that would allow a web graph representation to be put into the memory while maintaining random access time competitive to the time needed to access uncompressed web graph on a hard drive. There are already available techniques that accomplish this task, but there is still room for improvements and this thesis attempts to prove it. It includes a comparison of two methods contained in state of art of this field (BV and k2partitioned) to two already implemented algorithms (rewritten, however, in C++ programming language to maximize speed and resource management efficiency), which are LM and 2D, and introduces the new variant of the latter one, called 2D stripes. This thesis serves as well as a proof of concept. The final considerations show positive and negative aspects of all presented methods, expose the feasibility of the new variant as well as indicate future direction for development.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
