Computer-implemented method for storing unlimited amount of data as a mind map in relational database systems
A computer implemented method for creating and managing a database system comprising data structures for storing, in a memory, data and relations between the data, the method comprising the steps of creating a mind map structure wherein each node of the mind map represents a set in the first data structure and each branch represents a relation in the fifth data structure of the database in which there are defined five data structures that hold all information relating to tables, records and relations, namely: a first data structure comprising a definition of at least one data set, a second data structure comprising definitions of properties of objects, a third data structure comprising definitions of objects, a fourth data structure comprising definitions of properties of each object, a fifth data structure comprising definitions of relations and a sixth data structure for storing definitions of relations between objects.
This application is a continuation application of U.S. application Ser. No. 16/847,202, filed Apr. 13, 2020, which is a continuation application of U.S. application Ser. No. 15/866,713, filed Jan. 10, 2018, which is a continuation application of U.S. application Ser. No. 14/222,795, filed Mar. 24, 2014, which claims the benefit of priority under 35 U.S.C. 119 (a), (b) of European Patent Application No. 13461516.0, filed Mar. 29, 2013, each of which is entirely incorporated herein by reference.
TECHNICAL FIELDThe disclosure is related to computer-implemented methods and systems for creating and/or managing a database.
BACKGROUNDThe database is a data storage concept evolving for decades since the 1960s to ease increasing difficulties in designing, building, and maintaining complex information systems (multi-user systems with a large amount of data). Another term directly related to databases is a database management system (DBMS), which enables the effective handling of databases. It shall nevertheless be noted that the terms database and DBMS define different entities, they may be inseparable: a database's properties may be determined by its supporting DBMS. A DBMS is presently a complex software system such as general-purpose DBMSs, like Oracle or Microsoft SQL Server.
Techniques exist for computer-implemented methods and systems for creating and managing a database. In particular there are three major DBMS approaches widely used in the industry, e.g., relational databases, object databases and graph databases.
A relational database is a collection of data items organized as a set of formally described tables from which data can be accessed easily. A relational database may be created using the relational model. The software used in a relational database is called a relational database management system (RDBMS). A relational database may be a dominant choice for many data storage applications. An RDBMS may comprise of n number tables in which, for example, each table has its own primary key. The relational database was first defined in June 1970 by Edgar Codd, of IBM's San Jose Research Laboratory.
A problem with a relational database may be the complexity that arises when the relational database is created. It is generally important that defined relationships among the tables are correct and that each set of information is linked to its pair. Although less information has to be entered in total than with other database approaches, verifying that points are set up correctly may be a time-consuming process. Furthermore, the relationships can become complicated when a relational database comprises numerous tables.
An object database (also object-oriented database management system or OODBMS) is a database management system comprising information represented in the form of objects as used in object-oriented programming. Object databases may be different from relational databases and belong together in a broader database management system.
An object database may store complex data and relationships between data directly, without mapping to relational rows and columns, which may make object databases suitable for applications in which complex data may be encountered. Objects may have a many to many relationship and are accessed by the use of pointers. Pointers may be linked to objects to establish relationships. Another benefit of an OODBMS may be that an OODBMS may be programmed with small procedural differences without affecting the entire system. This may be helpful for those organizations in which data relationships may be used that are not entirely clear or there is a need to change these relations to satisfy a new business requirement.
Disadvantages of object databases may include lower efficiency when data is simple and relationships are simple, late binding may slow access speed, data and operations being separated, low responsiveness to changes in problem space, and inadequate design for concurrent problems, for example.
Over the years there have been designed hybrid object-relational databases. For example a pre-grant publication US 2003/0208493 A1 entitled “Object Relational Database Management System” appears to disclose an object relational database management system permitting a client application to access one or more data sources. A client application may direct queries to an object server component to obtain data from the data sources. An object server component may operate with an object definition component which may fulfill the queries. An object definition component may access an object definition database to obtain and use metadata, in the form of programmatic objects, about the location and structure of the data stored in the data sources. An optional object manager component may, for example, work with the object definition component to edit and create new metadata or, via the object server component, to work with and create new instances of the data sources.
As it pertains in particular to graph databases, such databases may depart from traditional storage and definitions paradigms. Many software developers may have experience with storing data in tabular form in a relational database. Such approaches may work well for some applications, but presently may begin to show drawbacks. Relational databases, for example, may exhibit difficulties in scaling. Unfortunately, more and more of today's innovative applications may involve massive data to be processed. In some instances, such large data processing requirements may expose a need for new approaches such as Graph Databases. For example, tables, such as tables used in relational databases, may be difficult to implement in Web-based environments. Since the Web may be characterized as collection of pages that are hyperlinked, not identically-shaped rows in a gigantic table, a graph database may more closely accord with present-day Web architectures. A graph, as known from mathematics, or as informally drawn by most engineers on whiteboards, may be a much more natural representation for data that is native to the web. Given that much of the data processed by today's innovative applications may exist elsewhere, the time of stovepipe applications may past. Additionally, some applications may not own a substantial percentage of their own data, such as some social feed aggregators.
A pre-grant publication number US2012096002 entitled “SYSTEMS AND METHODS FOR GENERATING AND MANAGING A UNIVERSAL SOCIAL GRAPH DATABASE,” appears to disclose a computer-implemented method for determining connections between entities that includes receiving private information from a user, retrieving public information from publicly available sources, and matching the public information with the private information. The method also includes generating a graph database with the public and private information, determining connections among entities in the graph database, and determining strength of connectivity between entities in the graph database. The disclosure appears to provide a system that tracks public and private connections between people and provides connection and profile information as a software platform via the Internet and at least one application programming interface. The system appears to implement or generate at least one graph database. The graph database may be updated in real time. Such a system may be capable of being used on a large scale to power cloud or software as a service based application that services simultaneous users and run simultaneous algorithms.
From known databases, such as ORACLE®, there is known an ALTER command. The process of modifying database structures directly requires locking a database structure that will be modified. There is also a related LOCK command that effectuates a freeze of a database structure for the time of modification such as adding, searching for or modifying records of a given table.
In production, end-user database systems, may make use of special scripts utilizing special triggers, which execute ALTER and/or LOCK commands automatically.
In some instances, an operation of adding a column to a database may lock a table. Further, an ALTER command may close currently executing data processing tasks such as transactions. This may render processing operations executing with varying number of parameters to be ineffective and may potentially threaten integrity of data gathering. Further, if data are collected very quickly, the size of a data buffer may be insufficient.
The use of the aforementioned commands in databases that are updated very frequently may be problematic in that such approaches may require databases to stop certain services. Hence it may also be beneficial to create a database system that does not require to stop the aforementioned services when, for example, a new column is to be added to an existing table.
Drawbacks of known graph databases include, for example, increased memory requirements and difficulties in presenting information to a user in a clear way. Further drawbacks of current database systems include lack of possibility of extending database in real time and difficulties in understanding how a complex database is designed.
Taking into account the present techniques there is a need to design and implement an efficient database model that is especially adapted to large scale databases, is easily scalable and has reduced memory requirement in comparison to graph, relational or object-oriented databases.
Up to now such problems have been addressed with a use of more powerful hardware such as database servers having higher performance and more memory instead of solutions related to design of the databases.
SUMMARYBriefly, particular embodiments may be directed to a computer implemented database system comprising data structures for storing, in a memory, data and information defining relations between the data. In an embodiment, the system may further comprise a first data structure, stored in the memory, comprising a definition of at least one data set wherein each data set comprises a data set identifier and logically holds data objects of the same type; a second data structure, stored in the memory, comprising definitions of properties of objects wherein each property comprises an identifier of the property and an identifier of a set, from the first data structure, the property is assigned to; a third data structure, stored in the memory, comprising definitions of objects wherein each object comprises an identifier and an identifier of a set, from the first data structure, the object is assigned to; a fourth data structure, stored in the memory, comprising definitions of properties of each object wherein each property of an object associates a value with an object, from the third data structure, and a property identifier, from the second data structure, the object is assigned to; a fifth data structure, stored in the memory, comprising definitions of relations wherein each relation comprises an identifier of the relation; and a sixth data structure, stored in the memory, for storing definitions of relations between objects wherein each objects relation associates a relation, from the fifth data structure, to two objects from the third data structure.
In some embodiments, a system may comprise a further property of name assigned to each entry in the first data structure to the second data structure and to the fifth data structure.
Advantageously, in some embodiments, the system comprises a seventh data structure, stored in the memory, for storing definitions of relations between sets wherein each sets relation associates a relation, from the fifth data structure, to two sets from the first data structure.
In an embodiment, a computer implemented method for creating and managing a database system comprising data structures for storing, in a memory, data and relations between the data, comprises the steps of creating a first data structure, stored in the memory, comprising a definition of at least one data set wherein each data set comprises a data set identifier and logically holds data objects of the same type; creating a second data structure, stored in the memory, comprising definitions of properties of objects wherein each property comprises an identifier of the property and an identifier of a set, from the first data structure, the property is assigned to; creating a third data structure, stored in the memory, comprising definitions of objects wherein each object comprises an identifier and an identifier of a set, from the first data structure, the object is assigned to; creating a fourth data structure, stored in the memory, comprising definitions of properties of each object wherein each property of an object associates a value with an object, from the third data structure, and a property of the set, from the second data structure, the object is assigned to; creating a fifth data structure, stored in the memory, comprising definitions of relations wherein each relation comprises an identifier of the relation; and creating a sixth data structure, stored in the memory, for storing definitions of relations between objects wherein each objects relation associates a relation, from the fifth data structure, to two objects from the third data structure.
In an embodiment, a computer implemented method for creating and managing a database system comprising data structures for storing, in a memory, data and relations between the data, comprises the steps of creating a mind map structure wherein each node of the mind map represents a set in the first data structure and each branch represents a relation in the fifth data structure of the database according to a first embodiment.
In some instances, the method, comprises the steps of assigning a name to each node of the mind map wherein each name of respective node is the name property of a record of the first data structure; and assigning a name to each branch of the mind map wherein each name of respective branch is the name property of the fifth data structure.
In some instances, the method, according to an embodiment, comprises the steps of assigning properties to each node of the mind map wherein each property is an entry in the second data structure.
In an embodiment of a method, the process of adding an object to the database comprises the steps of creating a new entry in the third data structure; for each object property of the given set defined in the second data structure, creating an entry in the fourth data structure.
In some instances a method, according to an embodiment, the process of adding an object to the database further comprises the steps of creating relations of the new object with existing objects by means of the sixth data structure.
In an embodiment, a method may involve a process of removing an object from the database, which may comprise the steps of identifying an object to be removed; fetching the unique identifier of the object to be removed; removing the object entry from the third data structure; removing all entries in the fourth data structure related to the object identifier being removed from the database.
A method may additionally comprise a process of removing an object from the database further, which may comprise steps of removing any existing relations of the removed object with other existing objects by means of deleting entries in the sixth data structure that relate to the object being removed.
A method embodying features of the present invention, may comprise computer software comprising program code means for performing all the steps of the computer-implemented method when said program is run on a computer.
An embodiment may comprise a computer readable recording medium for storing computer-executable instructions performing all the steps of the computer-implemented method when executed on a computer.
It should be understood that the aforementioned embodiments are merely example implementations, and that claimed subject matter is not necessarily limited to any particular aspect of these example implementations.
These and other features presented herein are accomplished by providing a computer-implemented method and system for creating and managing a database. Further details and features, their nature and various advantages will become more apparent from the following detailed description of the preferred embodiments shown in a drawing, in which:
Some portions of the detailed description which follows may be presented in terms of data processing procedures, steps or other symbolic representations of operations on data bits that can be performed on computer memory. Therefore, a computer executes such logical steps thus requiring physical manipulations of physical quantities. A computer-readable (storage) medium, such as referred to herein, typically may be non-transitory and/or comprise a non-transitory device. In this context, a non-transitory storage medium may include a device that is tangible, meaning that the device has a concrete physical form, although the device may change its physical state. Thus, for example, non-transitory refers to a device remaining tangible despite a change in state.
Usually these quantities take the form of electrical or magnetic signals capable of being stored, transferred, combined, compared, and otherwise manipulated in a computer system. For reasons of common usage, these signals are referred to as bits, packets, messages, values, elements, symbols, characters, terms, numbers, or the like.
Additionally, all of these and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to these quantities. Terms such as “processing” or “creating” or “transferring” or “executing” or “determining” or “detecting” or “obtaining” or “selecting” or “calculating” or “generating” or the like, refer to the action and processes of a computer system that manipulates and transforms data represented as physical (electronic) quantities within the computer's registers and memories into other data similarly represented as physical quantities within the memories or registers or other such information storage.
DESCRIPTION OF EMBODIMENTSRelational databases are well established on the market but may suffer from drawbacks of difficult scalability and extending, being also combined with limited suitability for really complex databases where there are, for example, 100 tables and 200 relations, although claimed subject matter is not limited in this respect. In very complex database systems, for example a database listing comprising 100 tables and 200 relations, the designer of a particular database may need to be keenly aware of every single table and how data from a particular table may relate to data from the remaining 99 tables. Having this knowledge at hand for all 100 tables may be an enormous task.
Tables 101 and 107 may comprise three entries while table 104 has four entries. The colors table 101 and the materials table 104 may be related, which may be defined by means of a relation 100c. Table 107 may link with table 104 and with intermediary relation table 110b by way of link 110d.
Typically, one defines foreign keys in a database to model relationships in the real world. Relationships between real-world entities may often be complex, involving numerous entities each having multiple relationships with one another. For example, a family may have multiple relationships between multiple people. In addition all relationships may exist at the same time. In a relational database, however, there are considered only relationships between pairs of tables. These tables may be related in one of three different ways: one-to-one, one-to-many or many-to-many.
The relation 100c is for example many-to-many relation where a color may be assigned to many materials but at the same time a material may be assigned to many colors.
Such relation in a real database system may be implemented by using an intermediary relation table 100a that provides mapping between elements of each table.
On a similar technical basis, in
A relational database may therefore be summarized, at least in some embodiments, as follows: there are at least two sets of elements and at least one relation that defines how elements from the first set are related to the elements of the second set, whereas the relation involves creation of a data structure mapping elements of the first set to elements of the second set. Typically the mapping may be brought about by means of unique identifiers (within each set) of the elements in each set.
It has been observed, that many problems that a relational database designer faces with respect to awareness of the complete design are a result of presenting real life events and entities on a very complex tables and relations diagram.
Real life cases, however, be may suitably defined and presented by means of mind maps. Mind maps however, have not so far found their application in database systems.
In embodiments, a mind map is a diagram, which may be used to visually outline and present information. A mind map may be created around a single object but may additionally be created around multiple objects. Objects may have associated ideas, words and concepts. In some instances, the major categories radiate from each node, and lesser categories are sub-branches of larger branches. Categories can represent words, ideas, tasks, or other items related to a central key word or idea.
Hence, there is designed a system that can be easily outlined as a mind map and designed technically such that a mind map representation may easily be transferred to a databases system design level and data storage abstraction level.
In order to more easily understand differences between the relational database of
The first set of data is called SETS 204, because it may be used to logically hold data related to sets of data. Sets of data may be represented on a mind map as nodes. Each entry in a SETS data structure 204 may comprise at least a unique identifier 205a and may also comprise its name 205. Referring back to example from
Each set of data may be, as in the real world, characterized by some properties typically referred to as columns. Hence, the second set of data may be called COLUMNS 206. A property, called typically a “column,” may be uniquely identified with an identifier ID 207 and maybe associated with a set, defined in the SETS data structure 204, by means of an identifier herein called SET ID 208. A column also may be associated with a name 209. As indicated by an arrow 204a, the COLUMNS data structure logically, directly references the SETS data structure, because the COLUMNS data structure may utilize the identifiers of sets. If, for example, each color of the set called COLORS comprises another property, say RGB value, there may possibly be added an entry comprising the following values: ‘1’, ‘4’, ‘RGB’. At such a level of the system types of respective data such as text, integer, BLOB may not be considered as their application in the present system is routine work.
Referring back to an example from
Having defined data structures of SETS and COLUMNS there may be defined objects that may form elements of respective SETS and may have properties defined by the COLUMNS data structure. Objects may be held in the OBJECTS 201 data structure. The OBJECTS 201 data structure may hold entries uniquely identified with an identifier ID 203 and associated with a set, defined in the SETS data structure 204, by means of an identifier herein called SET ID 202. As indicated by an arrow 201a, the OBJECTS data structure logically, directly references the SETS data structure, since, for example, the SETS data structure utilizes identifiers of sets.
Referring back to an example from
A fourth core data structure is a data structure that may hold data entries of each property of each object. This data structure has been identified as CHARACTERISTICS 301 in
The CHARACTERISTICS 301 data structure may hold entries uniquely identified using an identifier OBJECT ID 302 and maybe associated with a property, defined in the COLUMNS data structure 206, by means of an identifier herein referred to as COLUMNID 303. Further each entry in the CHARACTERISTICS data structure, may comprise a value of a given property of the particular object. As indicated by respective arrows originating from sources A and B, the CHARACTERISTICS data structure 301 logically, directly references the COLUMNS data structure and the OBJECTS data structure, because CHARACTERISTICS data structure 301 uses the identifiers from the respective data structures. Characteristics data structure 301 includes a VALUE property 304, such as black, white, red, rubber, plastic, wood, metal, axe, scythe, and hoe.
Referring back to an example from
A fifth core data structure, of the databases system according to particular embodiments, may be operator function to hold data regarding relations present in the database. This data structure has been referred to herein as RELATIONS 305. This may be a simple structure and, in principle, may hold an identifier of a relation ID 307 and additionally hold a textual description of the relation i.e. a NAME 306. As indicated by an arrow 305a, the RELATIONS data structure may logically, directly references downwards the OBJECTS RELATIONS data structure, because the OBJECTS RELATIONS may use the identifiers of the relations.
Referring back to mind maps, for example, a relation present in the RELATIONS 305 data structure, may be directly mapping to a branch between two nodes of a mind map. A relation may be of different types, however in certain embodiments, as in typical mind maps, a relation may be provided with a textual description.
The last core data structure of the present embodiment may be the mentioned OBJECTS RELATIONS data structure 308. This data structure may be designed to provide mapping between a relation from the RELATIONS data structure 305 and two objects from the OBJECTS data structure 301. For example a first entry in the OBJECTS RELATIONS data structure 308 defines that a relation having identifier of 1 exists between object having an identifier of 1 and an object having an identifier of 6. Referring to
In certain embodiments, a seventh data structure may exist in a database system. This data structure may hold data regarding relations between respective data sets and in
There is also a possibility of self-referencing from a given set. For example, such case may be present when there is a set of persons and there exists a student-teacher relation between persons assigned to a particular set.
As described, for example, a relational database system of 100 tables may, in one possible example implementation, be stored in the six above-described data structures. Naturally, most of the data may be kept in the OBJECTS and CHARACTERISTICS data structures.
Similar to the first two branches, a third branch 405 of the mind map is defined between MATERIALS 402 and TOOLS 406 and may imply that that a TOOL may be made of a MATERIAL. A fourth branch 405a of the mind map may be defined between MATERIALS 402 and TOOLS 406 and may imply that a MATERIAL may be associated with a TOOL.
The concept of
In particular embodiments, because all identifiers may be generated automatically, during creation of the database system of
Further, at block 503, a third data structure may be created and stored in the memory, the third data structure comprising definitions of objects wherein each object comprises an identifier and an identifier of a set the object is assigned to. At block 504 a fourth data structure is created and stored in the memory, the fourth data structure may comprise definitions of properties of each object wherein each property of an object associates a value with an object and a property of the set to which the object is assigned. Next at block 505 a fifth data structure is created and stored in the memory, the fifth data structure may comprise definitions of relations wherein each relation comprises an identifier of the relation. Finally, at block 506 a sixth data structure may be created and stored in the memory, the sixth data structure comprising definitions of relations between objects wherein each objects relation associates a relation from the fifth data structure to two objects from the third data structure.
Taking into account the database system according to particular embodiments, such as the embodiment of
At block 802 of the procedure, a new node may be added to the mind map structure. This is typically executed by using graphical user interface by a database designer. A node of a mind map represents a set as defined with reference to
The next block 804 may be to create a branch within the mind map. A branch may start at a node of the mind map and end at the same node of the mind map to define a self-relation. For example, there may be a set of users for which there exists a hierarchy among users. Alternatively a branch may start at a node of the mind map and end at a different node, for example, of the mind map to define a relation between different nodes i.e. different sets of objects of the same kind.
The next block 805 is executed to store a record in the fifth data structure, which is RELATIONS data structure 305 of
The last block of the procedure 806 is to add at least one object to existing data sets i.e. nodes of the mind map. In embodiments, a way of adding objects to mind map nodes may be by way of a graphical user interface. For example by choosing an option to add an object a user may be presented with a set of properties that may be set for the new object. The properties may be defined in the COLUMNS data structure 206 of
Lastly, referring back to the problem of disadvantageous effects of ALTER and LOCK commands and the problem of it being beneficial to create a database system that does not require stopping the aforementioned services when for example a new column is to be added to an existing table.
Particular embodiments of claimed subject matter may realize a database structure from a logical standpoint that is a type of is a kind of transposition of certain database structures. For example, addition of a new column to a table instead of modifying physical structure of a table may be representative of an operation of adding a new entry in the 206 structure, which may not require any kind of locking. Another advantage of particular embodiments of a database system is that an addition of a column to a table is much quicker than in prior art database systems since all processing is faster that invoking the known LOCK/ALTER commands. The aforementioned advantages are obtainable due to a specific arrangement of database metadata as shown in
It can be easily recognized, by one skilled in the art, that the aforementioned computer-implemented method and system for creating and managing a database may be performed and/or controlled by one or more computer programs. Such computer programs are typically executed by utilizing the computing resources in a computing device such as personal computers, personal digital assistants, cellular telephones, receivers and decoders of digital television or the like. Applications are stored in non-volatile memory, for example a flash memory or volatile memory, for example RAM and are executed by a processor. These memories are exemplary recording media for storing computer programs comprising computer-executable instructions performing all the steps of the computer-implemented method according the technical concept presented herein.
While the system and method presented herein have been depicted, described, and have been defined with reference to particular preferred embodiments, such references and examples of implementation in the foregoing specification do not imply any limitations. It will, however, be evident that various modifications and changes may be made thereto without departing from the broader scope of the technical concept. The presented preferred embodiments are exemplary only, and are not exhaustive of the scope of the technical concept presented herein.
Accordingly, the scope of protection is not limited to the preferred embodiments described in the specification, but is only limited by the claims that follow.
Claims
1. A computer implemented method for processing data in a database system, comprising:
- (a) displaying, on a graphical user interface (GUI), a mind map comprising a plurality of nodes and one or more directed links;
- (b) receiving, within the GUI, a user input for creating a new node and a new directed link between the new node and a node selected from the plurality of nodes in the mind map; and
- (c) creating, for the new directed link, an entry in a first data structure in the database system, which entry in the first data structure comprises an identifier of a relation and a name of the relation, wherein the relation is a relation between a first data set represented by the new node and a second data set represented by the node selected from the plurality of nodes in the mind map.
2. The computer implemented method of claim 1, wherein the new node is the selected node, and wherein the new directed link represents a self-relation.
3. The computer implemented method of claim 1, wherein the new node is different from the selected node.
4. The computer implemented method of claim 1, wherein the name of the relation comprises a text description of the relation.
5. The computer implemented method of claim 1, further comprising: creating, for the new node, (i) an entry in a second data structure in the database, which entry in the second data structure comprises a data set identifier and a set name, and (ii) an entry in a third data structure in the database, which entry in the third data structure comprises an identifier of a property of the new node and the data set identifier.
6. The computer implemented method of claim 1, further comprising receiving an additional user input via the GUI for adding an object to a given node selected from the plurality of nodes in the mind map.
7. The computer implemented method of claim 6, further comprising creating an entry in a fourth data structure of the database, which entry in the fourth data structure comprises an object identifier and a data set identifier corresponding to the selected node.
8. The computer implemented method of claim 7, further comprising creating an entry in a fifth data structure of the database, which entry in the fifth data structure comprises the object identifier, an identifier of a property and an object value assigned to the property.
9. The computer implemented method of claim 8, further comprising creating an entry in a sixth data structure of the database, which entry in the sixth data structure comprises an identifier of a relation between the object and an additional object, the object identifier of the object and an additional object identifier of additional object.
10. A non-transitory computer-readable medium comprising machine-executable instructions that, upon execution by one or more computer processors, implements a method for processing data in a database system using a mind map, said method comprising:
- (a) displaying, on a graphical user interface (GUI), a mind map comprising a plurality of nodes and one or more directed links;
- (b) receiving, within the GUI, a user input for creating a new node and a new directed link between the new node and a node selected from the plurality of nodes in the mind map; and
- (c) creating, for the new directed link, an entry in a first data structure in the database system, which entry in the first data structure comprises an identifier of a relation and a name of the relation, wherein the relation is a relation between a first data set represented by the new node and a second data set represented by the node selected from the plurality of nodes in the mind map.
11. The non-transitory computer-readable medium of claim 10, wherein the new node is the selected node, and wherein the new directed link represents a self-relation.
12. The non-transitory computer-readable medium of claim 10, wherein the new node is different from the selected node.
13. The non-transitory computer-readable medium of claim 10, wherein the name of the relation comprises a text description of the relation.
14. The non-transitory computer-readable medium of claim 10, wherein the method further comprises: creating, for the new node, (i) an entry in a second data structure in the database, which entry in the second data structure comprises a data set identifier and a set name, and (ii) an entry in a third data structure in the database, which entry in the third data structure comprises an identifier of a property of the new node and the data set identifier.
15. The non-transitory computer-readable medium of claim 10, wherein the method further comprises receiving an additional user input via the GUI for adding an object to a given node selected from the plurality of nodes in the mind map.
16. The non-transitory computer-readable medium of claim 12, wherein the method further comprises creating an entry in a fourth data structure of the database, which entry in the fourth data structure comprises an object identifier and a data set identifier corresponding to the selected node.
17. The non-transitory computer-readable medium of claim 13, wherein the method further comprises creating an entry in a fifth data structure of the database, which entry in the fifth data structure comprises the object identifier, an identifier of a property and an object value assigned to the property.
18. The non-transitory computer-readable medium of claim 14, wherein the method further comprises creating an entry in a sixth data structure of the database, which entry in the sixth data structure comprises an identifier of a relation between the object and another object, the object identifier of the object and an additional object identifier of the additional object.
| 5257349 | October 26, 1993 | Alexander |
| 5418961 | May 23, 1995 | Segal et al. |
| 5548758 | August 20, 1996 | Pirahesh et al. |
| 5604899 | February 18, 1997 | Doktor |
| 6038566 | March 14, 2000 | Tsai |
| 6105035 | August 15, 2000 | Monge |
| 6163775 | December 19, 2000 | Wlaschin et al. |
| 6192371 | February 20, 2001 | Schultz |
| 6208992 | March 27, 2001 | Bruckner |
| 6934712 | August 23, 2005 | Kiernan et al. |
| 6947945 | September 20, 2005 | Carey |
| 6986102 | January 10, 2006 | Baer et al. |
| 7058622 | June 6, 2006 | Tedesco |
| 7243106 | July 10, 2007 | Vierich et al. |
| 7363593 | April 22, 2008 | Loyens |
| 7895191 | February 22, 2011 | Colossi et al. |
| 8103703 | January 24, 2012 | Jetter |
| 8224829 | July 17, 2012 | Pauly |
| 8364623 | January 29, 2013 | Bunker |
| 8386920 | February 26, 2013 | Cox et al. |
| 8793246 | July 29, 2014 | Mathur et al. |
| 8874621 | October 28, 2014 | Goodwin et al. |
| 9218380 | December 22, 2015 | Adzic et al. |
| 9483508 | November 1, 2016 | Wilkes et al. |
| 9747312 | August 29, 2017 | Piecko |
| 10002143 | June 19, 2018 | Piecko |
| 10095743 | October 9, 2018 | Piecko |
| 10242056 | March 26, 2019 | Piecko |
| 10657111 | May 19, 2020 | Piecko |
| 10909099 | February 2, 2021 | Piecko |
| 11138162 | October 5, 2021 | Piecko |
| 20010051948 | December 13, 2001 | Srinivasan et al. |
| 20020029209 | March 7, 2002 | Bernal et al. |
| 20030088545 | May 8, 2003 | Subramaniam et al. |
| 20030208493 | November 6, 2003 | Hall |
| 20030229640 | December 11, 2003 | Carlson |
| 20040088283 | May 6, 2004 | Lissar et al. |
| 20040133581 | July 8, 2004 | Shinjo |
| 20040139102 | July 15, 2004 | Vierich |
| 20040255301 | December 16, 2004 | Turski et al. |
| 20050039033 | February 17, 2005 | Meyers et al. |
| 20050216503 | September 29, 2005 | Charlot et al. |
| 20050228818 | October 13, 2005 | Murthy et al. |
| 20060173841 | August 3, 2006 | Bill |
| 20060288035 | December 21, 2006 | Viavant |
| 20070112803 | May 17, 2007 | Pettovello |
| 20070198557 | August 23, 2007 | Ching |
| 20080021864 | January 24, 2008 | Bakalash et al. |
| 20080033987 | February 7, 2008 | Carter |
| 20080183658 | July 31, 2008 | Mangipudi |
| 20080232690 | September 25, 2008 | Saund et al. |
| 20080235211 | September 25, 2008 | Saund |
| 20080301181 | December 4, 2008 | Lori |
| 20090103715 | April 23, 2009 | Thorbjornsson |
| 20090222408 | September 3, 2009 | Charles et al. |
| 20100287212 | November 11, 2010 | Becker |
| 20100299348 | November 25, 2010 | Gill et al. |
| 20110231438 | September 22, 2011 | Pfeifle et al. |
| 20120096002 | April 19, 2012 | Sheehan |
| 20120117027 | May 10, 2012 | Shau et al. |
| 20120246147 | September 27, 2012 | Lamb et al. |
| 20120284635 | November 8, 2012 | Sitrick et al. |
| 20130083104 | April 4, 2013 | Mitsuki |
| 20130086104 | April 4, 2013 | Morrison et al. |
| 20130091180 | April 11, 2013 | Vicat-Blanc-Primet et al. |
| 20130144917 | June 6, 2013 | Hosurmath |
| 20130307843 | November 21, 2013 | Sikka et al. |
| 20130311518 | November 21, 2013 | Agbaria |
| 20140046983 | February 13, 2014 | Galloway et al. |
| 20140297693 | October 2, 2014 | Piecko |
| 0592046 | April 1994 | EP |
| 2455869 | May 2012 | EP |
| WO-02059793 | April 2003 | WO |
- Anonymous: II sql—Relational database design question—Surrogate-key or Natural-key?—Stack Overflow, Sep. 19, 2010 (Sep. 19, 2010), XP055109921, Retrieved from the Internet: URL:http://stackoverflow.com/questions/3747730/relational-database-design-question-surrogate-key-or-natural-key [retrieved on Mar. 25, 2014] “see answer from Mitch Dempsey”.
- European Patent Office Search Report; RE. Application No. 13461516.0 Report Date: Jul. 30, 2013.
- European Patent Office Search Report; RE. Application No. 13461536.8 Report Date: Sep. 10, 2013.
- European Patent Office Search Report; RE. Application No. 13461545.9 Report Date: Apr. 25, 2014.
- European Patent Office Search Report; RE. Application No. 13461546.7 Report Date: Apr. 11, 2014.
- Girvan et al. Community structure in social and biological networks. Proc Natl Acad Sci U S A. Jun. 11, 2002; 99(12): 7821-7826.
- Notice of Allowance dated Apr. 10, 2017 for U.S. Appl. No. 14/469,968.
- Notice of Allowance dated Apr. 28, 2017 for U.S. Appl. No. 14/469,968.
- Notice of Allowance dated Jul. 26, 2017 for U.S. Appl. No. 14/469,968.
- Notice of Allowance dated Dec. 19, 2017 for U.S. Appl. No. 14/222,795.
- Office action dated Feb. 11, 2016 for U.S. Appl. No. 14/222,795.
- Office Action dated Mar. 13, 2017 for U.S. Appl. No. 14/315,481.
- Office Action dated Apr. 28, 2017 for U.S. Appl. No. 14/222,795.
- Office Action dated May 26, 2017 for U.S. Appl. No. 14/469,958.
- Office action dated Jun. 2, 2016 for U.S. Appl. No. 14/222,795.
- Office Action dated Jul. 3, 2017 for U.S. Appl. No. 14/315,481.
- Office action dated Aug. 22, 2016 for U.S. Appl. No. 14/315,481.
- Office action dated Aug. 26, 2016 for U.S. Appl. No. 14/469,968.
- Office action dated Sep. 12, 2016 for U.S. Appl. No. 14/469,958.
- Office Action dated Sep. 22, 2016 for U.S. Appl. No. 14/222,795.
- Office Action dated Dec. 21, 2016 for U.S. Appl. No. 14/469,968.
- U.S. Appl. No. 14/222,795 Notice of Allowance dated Jan. 29, 2018.
- U.S. Appl. No. 15/866,713 Notice of Allowance dated Mar. 2, 2020.
- U.S. Appl. No. 14/315,481 Notice of Allowance dated Nov. 28, 2018.
- U.S. Appl. No. 14/315,481 Office Action dated May 17, 2018.
- U.S. Appl. No. 14/469,958 Notice of Allowance dated Jun. 29, 2018.
- U.S. Appl. No. 15/866,713 Office Action dated Sep. 18, 2019.
- U.S. Appl. No. 16/847,202 Notice of Allowance dated Jul. 26, 2021.
Type: Grant
Filed: Sep 3, 2021
Date of Patent: Jul 4, 2023
Patent Publication Number: 20220197875
Assignee: DataWalk Spölka Ákcyjna (Wroclaw)
Inventor: Krystian Piecko (Herndon, VA)
Primary Examiner: Jared M Bibbee
Application Number: 17/466,161
International Classification: G06F 16/00 (20190101); G06F 16/21 (20190101);
