Home / Cpp / 2Dstripes
Name Modified Size InfoDownloads / Week
Parent folder
stripes 2013-04-27
2Dstripes.suo 2012-06-16 23.0 kB
2Dstripes.sln 2012-05-05 1.2 kB
Totals: 3 Items   24.3 kB 0
Web graph compression with fast access
--------------------------------------

LM (C++):
	- lm.cpp contains compression and testing routines
	- At the beginning input directories, sets and log file names are defined.
	- In order to change h parameter, it is necessary to change the loop parameters inside functions.
	- If only compression or testing phase is needed, appropriate line has to be commented in main function.
	
	- Since the graph is stored in two files (graph.z, offsets.z) there must exist subdirectories in the output directory created in the following manner:
			outputDirectory / h / setName /
		so for h = (8, 16) and sets = ("eu-2005", "uk-2002") there should exist:
			/8/eu-2005/
			/8/uk-2002/
			/16/eu-2005/
			/16/uk-2002/


LM2 (C++):
	- The structure is very similar to LM2 (it was based on previous sources). The difference is in output files handling:
			outputDirectory / h /
		so for h = (8, 16) and sets = ("eu-2005", "uk-2002") only two directories should exist:
			/8/
			/16/
		and the graphs will be called setName.g for graph file setName.o for offsets file.
		
2D (C++):
	- 2D.cpp doesn't have two separate functions for compression and testing. Appropriate fragment of code is being commented instead.
	- To change the value of B, please modify the values in the main loop of the main function.
	- The directory tree is very similar to LM2, but instead of h, the values of B are used as directory names, thus for B = (128, 256)
			/128/
			/256/
		should exist (the compressed graph files will be called as in LM2).
	- Note that since it is a 2D method, we do not take transposed graphs as an input.

2D stripes (C++):
	- Since 2Dstripes.cpp was based on 2D.cpp it is very similar to 2D.
	- There is another nested loop for different stripe number K, so in order to change one has to modify the values in the loop.
Source: README, updated 2013-04-27