Abstract: A method and system for storing complex graph data. The graph data is represented by triples, quadruples, quintuples, etc. In order to speed up storage and retrieval of graph data, the data is stored in a form of triples, quadruples, quintuples, etc. in a B-tree. The B-trees are data structures that allow operations on dynamic data sets. The operations can be search, search for minimum and maximum values, insert, delete, reference to parent or child directory. The tree can be used as a dictionary or as a prioritized chain. The speed of tree operations is proportional to the height. The data is read as blocks from the same location. If a tree node is moved to an operational memory, an allocated memory block is moved and the operation executes very fast.

Abstract: A method for auto-generation of tags and retrieval of data form a graph-based database. A triplestore is a purpose-built database for the storage and retrieval of triples, a triple being a data entity (also known as a statement) composed of Subject-Predicate-Object. A triplestore is optimized for the storage and retrieval of triples. A query language is used for accessing to triples stored in the triplestore. A search items need to be tagged for search and retrieval. The number of tags increases as the amount of data increases. Stored data changes over time, so the old tags are deleted or replaced by the new tags. A large number of new tags must be created. The tags (i.e., autotags) are created automatically to facilitate efficient data retrieval from the triplestore.