Skip to content

Milestones

List view

  • Second Milestone

    * __Query language__ * Formal language for representing queries to our system * Choose query template * Need to have well-implemented: * Primitive values * Expressions, but probably we need an only equal sign * To find out if we need environments and variables * Basic identifier references * Order of evaluation for data(also not sure if we need this) <br><br> * __Successfully fetch searched data__ * Realization for CRUD operations with the compressed graph * Handle GET/POST/UPDATE/DELETE requests * Use inverted and forward indexes * Read and write that correspond to the query

    Overdue by 3 year(s)
    •
    Due by January 31, 2022
    •4/4 issues closed
    100% complete0 open4 closed

  • First Milestone

    * __B-tree implementation__ * Choose B-tree variety that fits best to our project * implement the balancing functions * create threads logic * try the two options for balancing the tree. * first with one thread that traces for unbalanced sections * second with a run of the balancing functions every time when the graph is changed <br><br> * __Metadata supporting B-tree__ * That table is needed because B-tree is based on knowing where the information is for best performance * realization and understanding about inverted and forward indexes <br><br> * __Compression__ * Understand use cases for sparse column and sparse row * Choose the best compression algorithm that satisfies our requirements. For now, we have stopped at two - sparse matrix and Huffman coding. Our strikes are: * Fast. Compression speed should be one of the main targets * Good compression. Compress files as much as possible without losing speed * Robust. Design the decompressor not to crash in the face of corrupted or malicious input * Create compression logic with compress and decompress functions * Use inverted and forward indexes * Implement partial decompression and when it is necessary to use it <br><br> * __Record the information in the corresponding files__ * There should be many files that keep compressed information * Probably in that way the information should be easily reachable and if the files are well distributed then this method will facilitate partial decompression and will increase the speed

    Overdue by 3 year(s)
    •
    Due by December 31, 2021
    •13/13 issues closed
    100% complete0 open13 closed