G-Store 0.11c (May 2011)

•    Bugs have been fixed. Some bugs could cause query execution to abort unexpectedly.

•    An experimental 64-bit version of G-Store has been compiled and is available for download here.

•    Two new boolean parameters have been added, count_io and print_query_time (default values: false). If count_io is set to true, G-Store prints to the command line for a query both the number of pages read and the number of disk accesses. During one disk access, many adjacent pages are usually read. If print_query_time is set to true, G-Store appends a one-line summary of statistics for a query to file “qtimes.g” in the folder with the G-Store executable.

•    For all PATH queries, in addition to query execution time, G-Store now prints to the command line the time until the path was found. Especially in IN PATH queries, printing a found path can take considerable time.

•    Parameters query_memory and max_disk_size are now specified in kilobytes instead of bytes. Their default values have been adjusted to 16384 and 4194303, respectively.


G-Store 0.11b (Dec 2010)

•    The data structures used in the refinement algorithm have been improved. G-Store’s storage algorithm is now faster and needs less memory. The default value for parameter runs_a has been changed to 2.

•    The finalization algorithm now attempts to join adjacent pages that are not full. This can decrease both CG and the size of the graph representation on disk.

•    Support for page sizes greater than 64 KB has been added. Previously, G-Store used 2-byte pointers within pages, which limited the number of addresses in a page to 216 = 65,536. In the current version, G-Store switches to 3-byte pointers if the user chooses a page size greater than 64 KB. The new maximum page size is 16 MB.

•    Minor changes in the command line user interface.

•    Parameters give_up_blk_multiple and default_fsblks_per_blk have been renamed to give_up_page_multiple and default_fsblks_per_page.


G-Store 0.11a (Oct 2010)

•    G-Store’s query engine now finds paths that satisfy regular expressions of the form (cond1 . cond2 . ... . condn)*. That is, paths that lead from a source vertex to a vertex that satisfies cond1, then to a vertex that satisfies cond2, ... , then to a vertex that satisfies condn, then to a vertex that satisfies cond1, ..., and then to a destination vertex.

To find such a path, append THROUGH SEQUENCE (cond | ANY) {. (cond | ANY)} to any IN PATH query. cond as in Figure 12 and Section 7.4. ANY is a special condition satisfied by every vertex.


G-Store 0.1 (Sep 2010)

•    Original version described here.