A method for retrieving data objects based on a spatial-temporal database includes modeling a to-be-managed object in consideration of temporal and spatial statuses of the to-be-managed object; setting specific attributes of the to-be-managed object that are expressed in a natural language according to resultant management models of the managed object; and performing retrieval based on types of the management models of the managed objects and a spatial and/or temporal attribute that is expressed in the natural language and defined by the models so as to determine the operational status of the to-be-managed object. Since data information about monitoring and management of production is described over three temporal periods that are associated to historical data, real-time data and plan data, a user can know spatial-temporal operational statuses of the to-be-managed object by performing retrieval using a spatial-temporal metalanguage, making data management simple and saving storage in computers.

Spatial-temporal database models used nowadays primarily are sequent snapshots, spatial-temporal cube models, base state with amendments models, and space-time composite models. These models each have characteristics as well as strengths and weaknesses, yet none of them is perfect for statistical applications. Some concepts of spatial-temporal database models, such as the idea about object-oriented spatial-temporal models, feature-based spatial-temporal database models, event-based spatial-temporal database models and the like, use either an object-oriented approach or a variation-based method to record spatial changes and relations. Nevertheless, these known schemes are somehow insufficient to deal with the complicated indexes and numerous statistic levels in a spatial-temporal database, and fail to meet the demands of statistics divisions in terms of business adaptability.
Spatial-temporal database models used nowadays primarily are sequent snapshots, spatial-temporal cube models, base state with amendments models, and space-time composite models. These models each have characteristics as well as strengths and weaknesses, yet none of them is perfect for statistical applications. Some concepts of spatial-temporal database models, such as the idea about object-oriented spatial-temporal models, feature-based spatial-temporal database models, event-based spatial-temporal database models and the like, use either an object-oriented approach or a variation-based method to record spatial changes and relations. Nevertheless, these known schemes are somehow insufficient to deal with the complicated indexes and numerous statistic levels in a spatial-temporal database, and fail to meet the demands of statistics divisions in terms of business adaptability.
China Patent No. CN103678712A discloses a disaster information spatial-temporal database that includes three information databases, namely a disaster current situation database; a disaster process database and a disaster historical database, a unified coding module carrying out layered coding on the received disaster information data; an attribute data management module and a space position management module introducing disaster information attribute data and space position data to the corresponding disaster information database; a logic conversion module allowing the disaster information data to be transmitted among all disaster information databases; and a spatial-temporal database index module building updating index for the disaster information spatial-temporal databases according to time sequence. The logic conversion module and the spatial-temporal database index module form the basis of the disaster information spatial-temporal database so as to achieve management and maintenance of the disaster attributes, conversion and maintenance of the spatial-temporal logic indexes, entry, retrieval and spatial-temporal inquiries of the statistics data. The shortcomings of the prior patent include: (1) it is impossible to directly conduct search in the relational database by entering temporal or spatial information; and (2) the retrieval is limited to a specific temporal range, and retrieval in a spatial range is impossible.
Currently, most spatial databases support spatial information by means of stored coordinate information, and use a self-growing ID (Identity) for indexing, so spatial structure algorithms are essential for data search. As solutions to the foregoing problem, many patents have tried to use simpler spatial indexing methods.
China Patent No. CN102622349B discloses a method for processing a positional information database that includes: obtaining a spatial position coordinate data; generating spatial position information encoding corresponding to the spatial position based on the coordinate data, comprising: defining a five-section spatial position information encoding rule applied to the geographical territory of China that is embodied as Country code—Area code: Subcode 1: Subcode 2—Additional code. The encoding rule implements a top-down principle, left-right numbering principle. A spatial position information database stores the spatial location information codes as indexes and position information of the spatial locations in the database. The shortcomings of the prior patent include: (1) the spatial description is not accurate and precise enough, particularly not distinctive for the top and bottom sections of some equipment in a factory; (2) the spatial analytics and encoding are not facile in terms of querying and calling data, and require special encoding rules; and (3) the database is not automatically updated as the physical location changes.
In application systems that use a relational database to store information, there are numerous multi-dimensional queries. This kind of queries provide multi-dimensional query rules for users to follow, and what the users want is to find information in a simple, fast and smart manner. To this end, databases have been optimized for query processing in the following ways: (1) reasonable use of indexes wherein separate and orderly storage structures are created for arranging data in a relational database by queried field, thereby improving query processing performance; (2) redundant relational data: wherein information from correlation tables is stored in a separate bivariate table as redundancy, thereby reducing association relationship during query processing and improving query processing performance; and (3) separate storage of big data, wherein big data is divided and separately stored by data type, thereby improving query processing performance.
China Patent No. CN100483411C discloses an information retrieval method of a relational database comprising the steps of: building a strategy tree for dimensional reduction and placing it in a database system, wherein the strategy tree for dimensional reduction includes at least one sub-node and at least one root node, each sub-node containing at least the current node identification number, the query condition combination and lower sub-node number identification; when a query obeying a query rule made to said database does not yield the desired data, building new query rules successively according to the strategy tree for dimensional reduction; performing retrieval in the database according to the new query rules until the desired data is obtained or until dimensional reduction reaches the root node of the strategy tree and no information on the desired data is reported. The prior patent is however not easy to use. In particular, number-based ID information is required for querying and calling data. In the world of industrial process control, there are so many parameters for equipment and processes in terms of both type and quantity, but querying data by number is awkward. This has long been a problem in applications of traditional relational database that every object needs a unique ID for its data to be found through retrieval. It is thus believed that a method allowing retrieval to be performed using a certain location of equipment or using the time point of a certain process parameter would make data retrieval more efficient.
As described previously, the existing database structures are all built with a series of complicated defining or value-assigning procedures. Thus, input or output of data is impossible without a dedicated program written in a programming language by the original programmer. Besides, software maintenance or upgrade of the database can only be done using source codes provided by the original programmer, and a user has to enter specific ID when trying to query or call data in the database. Therefore, there is a need for a more convenient, efficient and low-cost database system that can improve performance of existing databases and can be realized through configuration.
Spatial-temporal database models used nowadays primarily are sequent snapshots, spatial-temporal cube models, base state with amendments models, and space-time composite models. These models each have characteristics as well as strengths and weaknesses, yet none of them is perfect for statistical applications. Some concepts of spatial-temporal database models, such as the idea about object-oriented spatial-temporal models, feature-based spatial-temporal database models, event-based spatial-temporal database models and the like, use either an object-oriented approach or a variation-based method to record spatial changes and relations. Nevertheless, these known schemes are somehow insufficient to deal with the complicated indexes and numerous statistic levels in a spatial-temporal database, and fail to meet the demands of statistics divisions in terms of business adaptability.
China Patent No. CN103678712A discloses a disaster information spatial-temporal database that includes three information databases, namely a disaster current situation database; a disaster process database and a disaster historical database, a unified coding module carrying out layered coding on the received disaster information data; an attribute data management module and a space position management module introducing disaster information attribute data and space position data to the corresponding disaster information database; a logic conversion module allowing the disaster information data to be transmitted among all disaster information databases; and a spatial-temporal database index module building updating index for the disaster information spatial-temporal databases according to time sequence. The logic conversion module and the spatial-temporal database index module form the basis of the disaster information spatial-temporal database so as to achieve management and maintenance of the disaster attributes, conversion and maintenance of the spatial-temporal logic indexes, entry, retrieval and spatial-temporal inquiries of the statistics data. The shortcomings of the prior patent include: (1) it is impossible to directly conduct search in the relational database by entering temporal or spatial information; and (2) the retrieval is limited to a specific temporal range, and retrieval in a spatial range is impossible.
Currently, most spatial databases support spatial information by means of stored coordinate information, and use a self-growing ID (Identity) for indexing, so spatial structure algorithms are essential for data search. As solutions to the foregoing problem, many patents have tried to use simpler spatial indexing methods.
China Patent No. CN102622349B discloses a method for processing a positional information database that includes: obtaining a spatial position coordinate data; generating spatial position information encoding corresponding to the spatial position based on the coordinate data, comprising: defining a five-section spatial position information encoding rule applied to the geographical territory of China that is embodied as Country code—Area code: Subcode 1: Subcode 2—Additional code. The encoding rule implements a top-down principle, left-right numbering principle. A spatial position information database stores the spatial location information codes as indexes and position information of the spatial locations in the database. The shortcomings of the prior patent include: (1) the spatial description is not accurate and precise enough, particularly not distinctive for the top and bottom sections of some equipment in a factory; (2) the spatial analytics and encoding are not facile in terms of querying and calling data, and require special encoding rules; and (3) the database is not automatically updated as the physical location changes.
In application systems that use a relational database to store information, there are numerous multi-dimensional queries. This kind of queries provide multi-dimensional query rules for users to follow, and what the users want is to find information in a simple, fast and smart manner. To this end, databases have been optimized for query processing in the following ways: (1) reasonable use of indexes wherein separate and orderly storage structures are created for arranging data in a relational database by queried field, thereby improving query processing performance; (2) redundant relational data: wherein information from correlation tables is stored in a separate bivariate table as redundancy, thereby reducing association relationship during query processing and improving query processing performance; and (3) separate storage of big data, wherein big data is divided and separately stored by data type, thereby improving query processing performance.
China Patent No. CN100483411C discloses an information retrieval method of a relational database comprising the steps of: building a strategy tree for dimensional reduction and placing it in a database system, wherein the strategy tree for dimensional reduction includes at least one sub-node and at least one root node, each sub-node containing at least the current node identification number, the query condition combination and lower sub-node number identification; when a query obeying a query rule made to said database does not yield the desired data, building new query rules successively according to the strategy tree for dimensional reduction; performing retrieval in the database according to the new query rules until the desired data is obtained or until dimensional reduction reaches the root node of the strategy tree and no information on the desired data is reported. The prior patent is however not easy to use. In particular, number-based ID information is required for querying and calling data. In the world of industrial process control, there are so many parameters for equipment and processes in terms of both type and quantity, but querying data by number is awkward. This has long been a problem in applications of traditional relational database that every object needs a unique ID for its data to be found through retrieval. It is thus believed that a method allowing retrieval to be performed using a certain location of equipment or using the time point of a certain process parameter would make data retrieval more efficient.
As described previously, the existing database structures are all built with a series of complicated defining or value-assigning procedures. Thus, input or output of data is impossible without a dedicated program written in a programming language by the original programmer. Besides, software maintenance or upgrade of the database can only be done using source codes provided by the original programmer, and a user has to enter specific ID when trying to query or call data in the database. Therefore, there is a need for a more convenient, efficient and low-cost database system that can improve performance of existing databases and can be realized through configuration.
Spatial-temporal database models used nowadays primarily are sequent snapshots, spatial-temporal cube models, base state with amendments models, and space-time composite models. These models each have characteristics as well as strengths and weaknesses, yet none of them is perfect for statistical applications. Some concepts of spatial-temporal database models, such as the idea about object-oriented spatial-temporal models, feature-based spatial-temporal database models, event-based spatial-temporal database models and the like, use either an object-oriented approach or a variation-based method to record spatial changes and relations. Nevertheless, these known schemes are somehow insufficient to deal with the complicated indexes and numerous statistic levels in a spatial-temporal database, and fail to meet the demands of statistics divisions in terms of business adaptability.
China Patent No. CN103678712A discloses a disaster information spatial-temporal database that includes three information databases, namely a disaster current situation database; a disaster process database and a disaster historical database, a unified coding module carrying out layered coding on the received disaster information data; an attribute data management module and a space position management module introducing disaster information attribute data and space position data to the corresponding disaster information database; a logic conversion module allowing the disaster information data to be transmitted among all disaster information databases; and a spatial-temporal database index module building updating index for the disaster information spatial-temporal databases according to time sequence. The logic conversion module and the spatial-temporal database index module form the basis of the disaster information spatial-temporal database so as to achieve management and maintenance of the disaster attributes, conversion and maintenance of the spatial-temporal logic indexes, entry, retrieval and spatial-temporal inquiries of the statistics data. The shortcomings of the prior patent include: (1) it is impossible to directly conduct search in the relational database by entering temporal or spatial information; and (2) the retrieval is limited to a specific temporal range, and retrieval in a spatial range is impossible.
Currently, most spatial databases support spatial information by means of stored coordinate information, and use a self-growing ID (Identity) for indexing, so spatial structure algorithms are essential for data search. As solutions to the foregoing problem, many patents have tried to use simpler spatial indexing methods.
China Patent No. CN102622349B discloses a method for processing a positional information database that includes: obtaining a spatial position coordinate data; generating spatial position information encoding corresponding to the spatial position based on the coordinate data, comprising: defining a five-section spatial position information encoding rule applied to the geographical territory of China that is embodied as Country code—Area code: Subcode 1: Subcode 2—Additional code. The encoding rule implements a top-down principle, left-right numbering principle. A spatial position information database stores the spatial location information codes as indexes and position information of the spatial locations in the database. The shortcomings of the prior patent include: (1) the spatial description is not accurate and precise enough, particularly not distinctive for the top and bottom sections of some equipment in a factory; (2) the spatial analytics and encoding are not facile in terms of querying and calling data, and require special encoding rules; and (3) the database is not automatically updated as the physical location changes.
In application systems that use a relational database to store information, there are numerous multi-dimensional queries. This kind of queries provide multi-dimensional query rules for users to follow, and what the users want is to find information in a simple, fast and smart manner. To this end, databases have been optimized for query processing in the following ways: (1) reasonable use of indexes wherein separate and orderly storage structures are created for arranging data in a relational database by queried field, thereby improving query processing performance; (2) redundant relational data: wherein information from correlation tables is stored in a separate bivariate table as redundancy, thereby reducing association relationship during query processing and improving query processing performance; and (3) separate storage of big data, wherein big data is divided and separately stored by data type, thereby improving query processing performance.
China Patent No. CN100483411C discloses an information retrieval method of a relational database comprising the steps of: building a strategy tree for dimensional reduction and placing it in a database system, wherein the strategy tree for dimensional reduction includes at least one sub-node and at least one root node, each sub-node containing at least the current node identification number, the query condition combination and lower sub-node number identification; when a query obeying a query rule made to said database does not yield the desired data, building new query rules successively according to the strategy tree for dimensional reduction; performing retrieval in the database according to the new query rules until the desired data is obtained or until dimensional reduction reaches the root node of the strategy tree and no information on the desired data is reported. The prior patent is however not easy to use. In particular, number-based ID information is required for querying and calling data. In the world of industrial process control, there are so many parameters for equipment and processes in terms of both type and quantity, but querying data by number is awkward. This has long been a problem in applications of traditional relational database that every object needs a unique ID for its data to be found through retrieval. It is thus believed that a method allowing retrieval to be performed using a certain location of equipment or using the time point of a certain process parameter would make data retrieval more efficient.
As described previously, the existing database structures are all built with a series of complicated defining or value-assigning procedures. Thus, input or output of data is impossible without a dedicated program written in a programming language by the original programmer. Besides, software maintenance or upgrade of the database can only be done using source codes provided by the original programmer, and a user has to enter specific ID when trying to query or call data in the database. Therefore, there is a need for a more convenient, efficient and low-cost database system that can improve performance of existing databases and can be realized through configuration.
Spatial-temporal database models used nowadays primarily are sequent snapshots, spatial-temporal cube models, base state with amendments models, and space-time composite models. These models each have characteristics as well as strengths and weaknesses, yet none of them is perfect for statistical applications. Some concepts of spatial-temporal database models, such as the idea about object-oriented spatial-temporal models, feature-based spatial-temporal database models, event-based spatial-temporal database models and the like, use either an object-oriented approach or a variation-based method to record spatial changes and relations. Nevertheless, these known schemes are somehow insufficient to deal with the complicated indexes and numerous statistic levels in a spatial-temporal database, and fail to meet the demands of statistics divisions in terms of business adaptability.
China Patent No. CN103678712A discloses a disaster information spatial-temporal database that includes three information databases, namely a disaster current situation database; a disaster process database and a disaster historical database, a unified coding module carrying out layered coding on the received disaster information data; an attribute data management module and a space position management module introducing disaster information attribute data and space position data to the corresponding disaster information database; a logic conversion module allowing the disaster information data to be transmitted among all disaster information databases; and a spatial-temporal database index module building updating index for the disaster information spatial-temporal databases according to time sequence. The logic conversion module and the spatial-temporal database index module form the basis of the disaster information spatial-temporal database so as to achieve management and maintenance of the disaster attributes, conversion and maintenance of the spatial-temporal logic indexes, entry, retrieval and spatial-temporal inquiries of the statistics data. The shortcomings of the prior patent include: (1) it is impossible to directly conduct search in the relational database by entering temporal or spatial information; and (2) the retrieval is limited to a specific temporal range, and retrieval in a spatial range is impossible.
Currently, most spatial databases support spatial information by means of stored coordinate information, and use a self-growing ID (Identity) for indexing, so spatial structure algorithms are essential for data search. As solutions to the foregoing problem, many patents have tried to use simpler spatial indexing methods.
China Patent No. CN102622349B discloses a method for processing a positional information database that includes: obtaining a spatial position coordinate data; generating spatial position information encoding corresponding to the spatial position based on the coordinate data, comprising: defining a five-section spatial position information encoding rule applied to the geographical territory of China that is embodied as Country code—Area code: Subcode 1: Subcode 2—Additional code. The encoding rule implements a top-down principle, left-right numbering principle. A spatial position information database stores the spatial location information codes as indexes and position information of the spatial locations in the database. The shortcomings of the prior patent include: (1) the spatial description is not accurate and precise enough, particularly not distinctive for the top and bottom sections of some equipment in a factory; (2) the spatial analytics and encoding are not facile in terms of querying and calling data, and require special encoding rules; and (3) the database is not automatically updated as the physical location changes.
In application systems that use a relational database to store information, there are numerous multi-dimensional queries. This kind of queries provide multi-dimensional query rules for users to follow, and what the users want is to find information in a simple, fast and smart manner. To this end, databases have been optimized for query processing in the following ways: (1) reasonable use of indexes wherein separate and orderly storage structures are created for arranging data in a relational database by queried field, thereby improving query processing performance; (2) redundant relational data: wherein information from correlation tables is stored in a separate bivariate table as redundancy, thereby reducing association relationship during query processing and improving query processing performance; and (3) separate storage of big data, wherein big data is divided and separately stored by data type, thereby improving query processing performance.
China Patent No. CN100483411C discloses an information retrieval method of a relational database comprising the steps of: building a strategy tree for dimensional reduction and placing it in a database system, wherein the strategy tree for dimensional reduction includes at least one sub-node and at least one root node, each sub-node containing at least the current node identification number, the query condition combination and lower sub-node number identification; when a query obeying a query rule made to said database does not yield the desired data, building new query rules successively according to the strategy tree for dimensional reduction; performing retrieval in the database according to the new query rules until the desired data is obtained or until dimensional reduction reaches the root node of the strategy tree and no information on the desired data is reported. The prior patent is however not easy to use. In particular, number-based ID information is required for querying and calling data. In the world of industrial process control, there are so many parameters for equipment and processes in terms of both type and quantity, but querying data by number is awkward. This has long been a problem in applications of traditional relational database that every object needs a unique ID for its data to be found through retrieval. It is thus believed that a method allowing retrieval to be performed using a certain location of equipment or using the time point of a certain process parameter would make data retrieval more efficient.
As described previously, the existing database structures are all built with a series of complicated defining or value-assigning procedures. Thus, input or output of data is impossible without a dedicated program written in a programming language by the original programmer. Besides, software maintenance or upgrade of the database can only be done using source codes provided by the original programmer, and a user has to enter specific ID when trying to query or call data in the database. Therefore, there is a need for a more convenient, efficient and low-cost database system that can improve performance of existing databases and can be realized through configuration.
Spatial-temporal database models used nowadays primarily are sequent snapshots, spatial-temporal cube models, base state with amendments models, and space-time composite models. These models each have characteristics as well as strengths and weaknesses, yet none of them is perfect for statistical applications. Some concepts of spatial-temporal database models, such as the idea about object-oriented spatial-temporal models, feature-based spatial-temporal database models, event-based spatial-temporal database models and the like, use either an object-oriented approach or a variation-based method to record spatial changes and relations. Nevertheless, these known schemes are somehow insufficient to deal with the complicated indexes and numerous statistic levels in a spatial-temporal database, and fail to meet the demands of statistics divisions in terms of business adaptability.
China Patent No. CN103678712A discloses a disaster information spatial-temporal database that includes three information databases, namely a disaster current situation database; a disaster process database and a disaster historical database, a unified coding module carrying out layered coding on the received disaster information data; an attribute data management module and a space position management module introducing disaster information attribute data and space position data to the corresponding disaster information database; a logic conversion module allowing the disaster information data to be transmitted among all disaster information databases; and a spatial-temporal database index module building updating index for the disaster information spatial-temporal databases according to time sequence. The logic conversion module and the spatial-temporal database index module form the basis of the disaster information spatial-temporal database so as to achieve management and maintenance of the disaster attributes, conversion and maintenance of the spatial-temporal logic indexes, entry, retrieval and spatial-temporal inquiries of the statistics data. The shortcomings of the prior patent include: (1) it is impossible to directly conduct search in the relational database by entering temporal or spatial information; and (2) the retrieval is limited to a specific temporal range, and retrieval in a spatial range is impossible.
Currently, most spatial databases support spatial information by means of stored coordinate information, and use a self-growing ID (Identity) for indexing, so spatial structure algorithms are essential for data search. As solutions to the foregoing problem, many patents have tried to use simpler spatial indexing methods.
China Patent No. CN102622349B discloses a method for processing a positional information database that includes: obtaining a spatial position coordinate data; generating spatial position information encoding corresponding to the spatial position based on the coordinate data, comprising: defining a five-section spatial position information encoding rule applied to the geographical territory of China that is embodied as Country code—Area code: Subcode 1: Subcode 2—Additional code. The encoding rule implements a top-down principle, left-right numbering principle. A spatial position information database stores the spatial location information codes as indexes and position information of the spatial locations in the database. The shortcomings of the prior patent include: (1) the spatial description is not accurate and precise enough, particularly not distinctive for the top and bottom sections of some equipment in a factory; (2) the spatial analytics and encoding are not facile in terms of querying and calling data, and require special encoding rules; and (3) the database is not automatically updated as the physical location changes.
In application systems that use a relational database to store information, there are numerous multi-dimensional queries. This kind of queries provide multi-dimensional query rules for users to follow, and what the users want is to find information in a simple, fast and smart manner. To this end, databases have been optimized for query processing in the following ways: (1) reasonable use of indexes wherein separate and orderly storage structures are created for arranging data in a relational database by queried field, thereby improving query processing performance; (2) redundant relational data: wherein information from correlation tables is stored in a separate bivariate table as redundancy, thereby reducing association relationship during query processing and improving query processing performance; and (3) separate storage of big data, wherein big data is divided and separately stored by data type, thereby improving query processing performance.
China Patent No. CN100483411C discloses an information retrieval method of a relational database comprising the steps of: building a strategy tree for dimensional reduction and placing it in a database system, wherein the strategy tree for dimensional reduction includes at least one sub-node and at least one root node, each sub-node containing at least the current node identification number, the query condition combination and lower sub-node number identification; when a query obeying a query rule made to said database does not yield the desired data, building new query rules successively according to the strategy tree for dimensional reduction; performing retrieval in the database according to the new query rules until the desired data is obtained or until dimensional reduction reaches the root node of the strategy tree and no information on the desired data is reported. The prior patent is however not easy to use. In particular, number-based ID information is required for querying and calling data. In the world of industrial process control, there are so many parameters for equipment and processes in terms of both type and quantity, but querying data by number is awkward. This has long been a problem in applications of traditional relational database that every object needs a unique ID for its data to be found through retrieval. It is thus believed that a method allowing retrieval to be performed using a certain location of equipment or using the time point of a certain process parameter would make data retrieval more efficient.
As described previously, the existing database structures are all built with a series of complicated defining or value-assigning procedures. Thus, input or output of data is impossible without a dedicated program written in a programming language by the original programmer. Besides, software maintenance or upgrade of the database can only be done using source codes provided by the original programmer, and a user has to enter specific ID when trying to query or call data in the database. Therefore, there is a need for a more convenient, efficient and low-cost database system that can improve performance of existing databases and can be realized through configuration.
Spatial-temporal database models used nowadays primarily are sequent snapshots, spatial-temporal cube models, base state with amendments models, and space-time composite models. These models each have characteristics as well as strengths and weaknesses, yet none of them is perfect for statistical applications. Some concepts of spatial-temporal database models, such as the idea about object-oriented spatial-temporal models, feature-based spatial-temporal database models, event-based spatial-temporal database models and the like, use either an object-oriented approach or a variation-based method to record spatial changes and relations. Nevertheless, these known schemes are somehow insufficient to deal with the complicated indexes and numerous statistic levels in a spatial-temporal database, and fail to meet the demands of statistics divisions in terms of business adaptability.
China Patent No. CN103678712A discloses a disaster information spatial-temporal database that includes three information databases, namely a disaster current situation database; a disaster process database and a disaster historical database, a unified coding module carrying out layered coding on the received disaster information data; an attribute data management module and a space position management module introducing disaster information attribute data and space position data to the corresponding disaster information database; a logic conversion module allowing the disaster information data to be transmitted among all disaster information databases; and a spatial-temporal database index module building updating index for the disaster information spatial-temporal databases according to time sequence. The logic conversion module and the spatial-temporal database index module form the basis of the disaster information spatial-temporal database so as to achieve management and maintenance of the disaster attributes, conversion and maintenance of the spatial-temporal logic indexes, entry, retrieval and spatial-temporal inquiries of the statistics data. The shortcomings of the prior patent include: (1) it is impossible to directly conduct search in the relational database by entering temporal or spatial information; and (2) the retrieval is limited to a specific temporal range, and retrieval in a spatial range is impossible.
Currently, most spatial databases support spatial information by means of stored coordinate information, and use a self-growing ID (Identity) for indexing, so spatial structure algorithms are essential for data search. As solutions to the foregoing problem, many patents have tried to use simpler spatial indexing methods.
China Patent No. CN102622349B discloses a method for processing a positional information database that includes: obtaining a spatial position coordinate data; generating spatial position information encoding corresponding to the spatial position based on the coordinate data, comprising: defining a five-section spatial position information encoding rule applied to the geographical territory of China that is embodied as Country code—Area code: Subcode 1: Subcode 2—Additional code. The encoding rule implements a top-down principle, left-right numbering principle. A spatial position information database stores the spatial location information codes as indexes and position information of the spatial locations in the database. The shortcomings of the prior patent include: (1) the spatial description is not accurate and precise enough, particularly not distinctive for the top and bottom sections of some equipment in a factory; (2) the spatial analytics and encoding are not facile in terms of querying and calling data, and require special encoding rules; and (3) the database is not automatically updated as the physical location changes.
In application systems that use a relational database to store information, there are numerous multi-dimensional queries. This kind of queries provide multi-dimensional query rules for users to follow, and what the users want is to find information in a simple, fast and smart manner. To this end, databases have been optimized for query processing in the following ways: (1) reasonable use of indexes wherein separate and orderly storage structures are created for arranging data in a relational database by queried field, thereby improving query processing performance; (2) redundant relational data: wherein information from correlation tables is stored in a separate bivariate table as redundancy, thereby reducing association relationship during query processing and improving query processing performance; and (3) separate storage of big data, wherein big data is divided and separately stored by data type, thereby improving query processing performance.
China Patent No. CN100483411C discloses an information retrieval method of a relational database comprising the steps of: building a strategy tree for dimensional reduction and placing it in a database system, wherein the strategy tree for dimensional reduction includes at least one sub-node and at least one root node, each sub-node containing at least the current node identification number, the query condition combination and lower sub-node number identification; when a query obeying a query rule made to said database does not yield the desired data, building new query rules successively according to the strategy tree for dimensional reduction; performing retrieval in the database according to the new query rules until the desired data is obtained or until dimensional reduction reaches the root node of the strategy tree and no information on the desired data is reported. The prior patent is however not easy to use. In particular, number-based ID information is required for querying and calling data. In the world of industrial process control, there are so many parameters for equipment and processes in terms of both type and quantity, but querying data by number is awkward. This has long been a problem in applications of traditional relational database that every object needs a unique ID for its data to be found through retrieval. It is thus believed that a method allowing retrieval to be performed using a certain location of equipment or using the time point of a certain process parameter would make data retrieval more efficient.
As described previously, the existing database structures are all built with a series of complicated defining or value-assigning procedures. Thus, input or output of data is impossible without a dedicated program written in a programming language by the original programmer. Besides, software maintenance or upgrade of the database can only be done using source codes provided by the original programmer, and a user has to enter specific ID when trying to query or call data in the database. Therefore, there is a need for a more convenient, efficient and low-cost database system that can improve performance of existing databases and can be realized through configuration.
Spatial-temporal database models used nowadays primarily are sequent snapshots, spatial-temporal cube models, base state with amendments models, and space-time composite models. These models each have characteristics as well as strengths and weaknesses, yet none of them is perfect for statistical applications. Some concepts of spatial-temporal database models, such as the idea about object-oriented spatial-temporal models, feature-based spatial-temporal database models, event-based spatial-temporal database models and the like, use either an object-oriented approach or a variation-based method to record spatial changes and relations. Nevertheless, these known schemes are somehow insufficient to deal with the complicated indexes and numerous statistic levels in a spatial-temporal database, and fail to meet the demands of statistics divisions in terms of business adaptability.
China Patent No. CN103678712A discloses a disaster information spatial-temporal database that includes three information databases, namely a disaster current situation database; a disaster process database and a disaster historical database, a unified coding module carrying out layered coding on the received disaster information data; an attribute data management module and a space position management module introducing disaster information attribute data and space position data to the corresponding disaster information database; a logic conversion module allowing the disaster information data to be transmitted among all disaster information databases; and a spatial-temporal database index module building updating index for the disaster information spatial-temporal databases according to time sequence. The logic conversion module and the spatial-temporal database index module form the basis of the disaster information spatial-temporal database so as to achieve management and maintenance of the disaster attributes, conversion and maintenance of the spatial-temporal logic indexes, entry, retrieval and spatial-temporal inquiries of the statistics data. The shortcomings of the prior patent include: (1) it is impossible to directly conduct search in the relational database by entering temporal or spatial information; and (2) the retrieval is limited to a specific temporal range, and retrieval in a spatial range is impossible.
Currently, most spatial databases support spatial information by means of stored coordinate information, and use a self-growing ID (Identity) for indexing, so spatial structure algorithms are essential for data search. As solutions to the foregoing problem, many patents have tried to use simpler spatial indexing methods.
China Patent No. CN102622349B discloses a method for processing a positional information database that includes: obtaining a spatial position coordinate data; generating spatial position information encoding corresponding to the spatial position based on the coordinate data, comprising: defining a five-section spatial position information encoding rule applied to the geographical territory of China that is embodied as Country code—Area code: Subcode 1: Subcode 2—Additional code. The encoding rule implements a top-down principle, left-right numbering principle. A spatial position information database stores the spatial location information codes as indexes and position information of the spatial locations in the database. The shortcomings of the prior patent include: (1) the spatial description is not accurate and precise enough, particularly not distinctive for the top and bottom sections of some equipment in a factory; (2) the spatial analytics and encoding are not facile in terms of querying and calling data, and require special encoding rules; and (3) the database is not automatically updated as the physical location changes.
In application systems that use a relational database to store information, there are numerous multi-dimensional queries. This kind of queries provide multi-dimensional query rules for users to follow, and what the users want is to find information in a simple, fast and smart manner. To this end, databases have been optimized for query processing in the following ways: (1) reasonable use of indexes wherein separate and orderly storage structures are created for arranging data in a relational database by queried field, thereby improving query processing performance; (2) redundant relational data: wherein information from correlation tables is stored in a separate bivariate table as redundancy, thereby reducing association relationship during query processing and improving query processing performance; and (3) separate storage of big data, wherein big data is divided and separately stored by data type, thereby improving query processing performance.
China Patent No. CN100483411C discloses an information retrieval method of a relational database comprising the steps of: building a strategy tree for dimensional reduction and placing it in a database system, wherein the strategy tree for dimensional reduction includes at least one sub-node and at least one root node, each sub-node containing at least the current node identification number, the query condition combination and lower sub-node number identification; when a query obeying a query rule made to said database does not yield the desired data, building new query rules successively according to the strategy tree for dimensional reduction; performing retrieval in the database according to the new query rules until the desired data is obtained or until dimensional reduction reaches the root node of the strategy tree and no information on the desired data is reported. The prior patent is however not easy to use. In particular, number-based ID information is required for querying and calling data. In the world of industrial process control, there are so many parameters for equipment and processes in terms of both type and quantity, but querying data by number is awkward. This has long been a problem in applications of traditional relational database that every object needs a unique ID for its data to be found through retrieval. It is thus believed that a method allowing retrieval to be performed using a certain location of equipment or using the time point of a certain process parameter would make data retrieval more efficient.
As described previously, the existing database structures are all built with a series of complicated defining or value-assigning procedures. Thus, input or output of data is impossible without a dedicated program written in a programming language by the original programmer. Besides, software maintenance or upgrade of the database can only be done using source codes provided by the original programmer, and a user has to enter specific ID when trying to query or call data in the database. Therefore, there is a need for a more convenient, efficient and low-cost database system that can improve performance of existing databases and can be realized through configuration.
Spatial-temporal database models used nowadays primarily are sequent snapshots, spatial-temporal cube models, base state with amendments models, and space-time composite models. These models each have characteristics as well as strengths and weaknesses, yet none of them is perfect for statistical applications. Some concepts of spatial-temporal database models, such as the idea about object-oriented spatial-temporal models, feature-based spatial-temporal database models, event-based spatial-temporal database models and the like, use either an object-oriented approach or a variation-based method to record spatial changes and relations. Nevertheless, these known schemes are somehow insufficient to deal with the complicated indexes and numerous statistic levels in a spatial-temporal database, and fail to meet the demands of statistics divisions in terms of business adaptability.
China Patent No. CN103678712A discloses a disaster information spatial-temporal database that includes three information databases, namely a disaster current situation database; a disaster process database and a disaster historical database, a unified coding module carrying out layered coding on the received disaster information data; an attribute data management module and a space position management module introducing disaster information attribute data and space position data to the corresponding disaster information database; a logic conversion module allowing the disaster information data to be transmitted among all disaster information databases; and a spatial-temporal database index module building updating index for the disaster information spatial-temporal databases according to time sequence. The logic conversion module and the spatial-temporal database index module form the basis of the disaster information spatial-temporal database so as to achieve management and maintenance of the disaster attributes, conversion and maintenance of the spatial-temporal logic indexes, entry, retrieval and spatial-temporal inquiries of the statistics data. The shortcomings of the prior patent include: (1) it is impossible to directly conduct search in the relational database by entering temporal or spatial information; and (2) the retrieval is limited to a specific temporal range, and retrieval in a spatial range is impossible.
Currently, most spatial databases support spatial information by means of stored coordinate information, and use a self-growing ID (Identity) for indexing, so spatial structure algorithms are essential for data search. As solutions to the foregoing problem, many patents have tried to use simpler spatial indexing methods.
China Patent No. CN102622349B discloses a method for processing a positional information database that includes: obtaining a spatial position coordinate data; generating spatial position information encoding corresponding to the spatial position based on the coordinate data, comprising: defining a five-section spatial position information encoding rule applied to the geographical territory of China that is embodied as Country code—Area code: Subcode 1: Subcode 2—Additional code. The encoding rule implements a top-down principle, left-right numbering principle. A spatial position information database stores the spatial location information codes as indexes and position information of the spatial locations in the database. The shortcomings of the prior patent include: (1) the spatial description is not accurate and precise enough, particularly not distinctive for the top and bottom sections of some equipment in a factory; (2) the spatial analytics and encoding are not facile in terms of querying and calling data, and require special encoding rules; and (3) the database is not automatically updated as the physical location changes.
In application systems that use a relational database to store information, there are numerous multi-dimensional queries. This kind of queries provide multi-dimensional query rules for users to follow, and what the users want is to find information in a simple, fast and smart manner. To this end, databases have been optimized for query processing in the following ways: (1) reasonable use of indexes wherein separate and orderly storage structures are created for arranging data in a relational database by queried field, thereby improving query processing performance; (2) redundant relational data: wherein information from correlation tables is stored in a separate bivariate table as redundancy, thereby reducing association relationship during query processing and improving query processing performance; and (3) separate storage of big data, wherein big data is divided and separately stored by data type, thereby improving query processing performance.
China Patent No. CN100483411C discloses an information retrieval method of a relational database comprising the steps of: building a strategy tree for dimensional reduction and placing it in a database system, wherein the strategy tree for dimensional reduction includes at least one sub-node and at least one root node, each sub-node containing at least the current node identification number, the query condition combination and lower sub-node number identification; when a query obeying a query rule made to said database does not yield the desired data, building new query rules successively according to the strategy tree for dimensional reduction; performing retrieval in the database according to the new query rules until the desired data is obtained or until dimensional reduction reaches the root node of the strategy tree and no information on the desired data is reported. The prior patent is however not easy to use. In particular, number-based ID information is required for querying and calling data. In the world of industrial process control, there are so many parameters for equipment and processes in terms of both type and quantity, but querying data by number is awkward. This has long been a problem in applications of traditional relational database that every object needs a unique ID for its data to be found through retrieval. It is thus believed that a method allowing retrieval to be performed using a certain location of equipment or using the time point of a certain process parameter would make data retrieval more efficient.
As described previously, the existing database structures are all built with a series of complicated defining or value-assigning procedures. Thus, input or output of data is impossible without a dedicated program written in a programming language by the original programmer. Besides, software maintenance or upgrade of the database can only be done using source codes provided by the original programmer, and a user has to enter specific ID when trying to query or call data in the database. Therefore, there is a need for a more convenient, efficient and low-cost database system that can improve performance of existing databases and can be realized through configuration.
Spatial-temporal database models used nowadays primarily are sequent snapshots, spatial-temporal cube models, base state with amendments models, and space-time composite models. These models each have characteristics as well as strengths and weaknesses, yet none of them is perfect for statistical applications. Some concepts of spatial-temporal database models, such as the idea about object-oriented spatial-temporal models, feature-based spatial-temporal database models, event-based spatial-temporal database models and the like, use either an object-oriented approach or a variation-based method to record spatial changes and relations. Nevertheless, these known schemes are somehow insufficient to deal with the complicated indexes and numerous statistic levels in a spatial-temporal database, and fail to meet the demands of statistics divisions in terms of business adaptability.
China Patent No. CN103678712A discloses a disaster information spatial-temporal database that includes three information databases, namely a disaster current situation database; a disaster process database and a disaster historical database, a unified coding module carrying out layered coding on the received disaster information data; an attribute data management module and a space position management module introducing disaster information attribute data and space position data to the corresponding disaster information database; a logic conversion module allowing the disaster information data to be transmitted among all disaster information databases; and a spatial-temporal database index module building updating index for the disaster information spatial-temporal databases according to time sequence. The logic conversion module and the spatial-temporal database index module form the basis of the disaster information spatial-temporal database so as to achieve management and maintenance of the disaster attributes, conversion and maintenance of the spatial-temporal logic indexes, entry, retrieval and spatial-temporal inquiries of the statistics data. The shortcomings of the prior patent include: (1) it is impossible to directly conduct search in the relational database by entering temporal or spatial information; and (2) the retrieval is limited to a specific temporal range, and retrieval in a spatial range is impossible.
Currently, most spatial databases support spatial information by means of stored coordinate information, and use a self-growing ID (Identity) for indexing, so spatial structure algorithms are essential for data search. As solutions to the foregoing problem, many patents have tried to use simpler spatial indexing methods.
China Patent No. CN102622349B discloses a method for processing a positional information database that includes: obtaining a spatial position coordinate data; generating spatial position information encoding corresponding to the spatial position based on the coordinate data, comprising: defining a five-section spatial position information encoding rule applied to the geographical territory of China that is embodied as Country code—Area code: Subcode 1: Subcode 2—Additional code. The encoding rule implements a top-down principle, left-right numbering principle. A spatial position information database stores the spatial location information codes as indexes and position information of the spatial locations in the database. The shortcomings of the prior patent include: (1) the spatial description is not accurate and precise enough, particularly not distinctive for the top and bottom sections of some equipment in a factory; (2) the spatial analytics and encoding are not facile in terms of querying and calling data, and require special encoding rules; and (3) the database is not automatically updated as the physical location changes.
In application systems that use a relational database to store information, there are numerous multi-dimensional queries. This kind of queries provide multi-dimensional query rules for users to follow, and what the users want is to find information in a simple, fast and smart manner. To this end, databases have been optimized for query processing in the following ways: (1) reasonable use of indexes wherein separate and orderly storage structures are created for arranging data in a relational database by queried field, thereby improving query processing performance; (2) redundant relational data: wherein information from correlation tables is stored in a separate bivariate table as redundancy, thereby reducing association relationship during query processing and improving query processing performance; and (3) separate storage of big data, wherein big data is divided and separately stored by data type, thereby improving query processing performance.
China Patent No. CN100483411C discloses an information retrieval method of a relational database comprising the steps of: building a strategy tree for dimensional reduction and placing it in a database system, wherein the strategy tree for dimensional reduction includes at least one sub-node and at least one root node, each sub-node containing at least the current node identification number, the query condition combination and lower sub-node number identification; when a query obeying a query rule made to said database does not yield the desired data, building new query rules successively according to the strategy tree for dimensional reduction; performing retrieval in the database according to the new query rules until the desired data is obtained or until dimensional reduction reaches the root node of the strategy tree and no information on the desired data is reported. The prior patent is however not easy to use. In particular, number-based ID information is required for querying and calling data. In the world of industrial process control, there are so many parameters for equipment and processes in terms of both type and quantity, but querying data by number is awkward. This has long been a problem in applications of traditional relational database that every object needs a unique ID for its data to be found through retrieval. It is thus believed that a method allowing retrieval to be performed using a certain location of equipment or using the time point of a certain process parameter would make data retrieval more efficient.
As described previously, the existing database structures are all built with a series of complicated defining or value-assigning procedures. Thus, input or output of data is impossible without a dedicated program written in a programming language by the original programmer. Besides, software maintenance or upgrade of the database can only be done using source codes provided by the original programmer, and a user has to enter specific ID when trying to query or call data in the database. Therefore, there is a need for a more convenient, efficient and low-cost database system that can improve performance of existing databases and can be realized through configuration.
Spatial-temporal database models used nowadays primarily are sequent snapshots, spatial-temporal cube models, base state with amendments models, and space-time composite models. These models each have characteristics as well as strengths and weaknesses, yet none of them is perfect for statistical applications. Some concepts of spatial-temporal database models, such as the idea about object-oriented spatial-temporal models, feature-based spatial-temporal database models, event-based spatial-temporal database models and the like, use either an object-oriented approach or a variation-based method to record spatial changes and relations. Nevertheless, these known schemes are somehow insufficient to deal with the complicated indexes and numerous statistic levels in a spatial-temporal database, and fail to meet the demands of statistics divisions in terms of business adaptability.
China Patent No. CN103678712A discloses a disaster information spatial-temporal database that includes three information databases, namely a disaster current situation database; a disaster process database and a disaster historical database, a unified coding module carrying out layered coding on the received disaster information data; an attribute data management module and a space position management module introducing disaster information attribute data and space position data to the corresponding disaster information database; a logic conversion module allowing the disaster information data to be transmitted among all disaster information databases; and a spatial-temporal database index module building updating index for the disaster information spatial-temporal databases according to time sequence. The logic conversion module and the spatial-temporal database index module form the basis of the disaster information spatial-temporal database so as to achieve management and maintenance of the disaster attributes, conversion and maintenance of the spatial-temporal logic indexes, entry, retrieval and spatial-temporal inquiries of the statistics data. The shortcomings of the prior patent include: (1) it is impossible to directly conduct search in the relational database by entering temporal or spatial information; and (2) the retrieval is limited to a specific temporal range, and retrieval in a spatial range is impossible.
Currently, most spatial databases support spatial information by means of stored coordinate information, and use a self-growing ID (Identity) for indexing, so spatial structure algorithms are essential for data search. As solutions to the foregoing problem, many patents have tried to use simpler spatial indexing methods.
China Patent No. CN102622349B discloses a method for processing a positional information database that includes: obtaining a spatial position coordinate data; generating spatial position information encoding corresponding to the spatial position based on the coordinate data, comprising: defining a five-section spatial position information encoding rule applied to the geographical territory of China that is embodied as Country code—Area code: Subcode 1: Subcode 2—Additional code. The encoding rule implements a top-down principle, left-right numbering principle. A spatial position information database stores the spatial location information codes as indexes and position information of the spatial locations in the database. The shortcomings of the prior patent include: (1) the spatial description is not accurate and precise enough, particularly not distinctive for the top and bottom sections of some equipment in a factory; (2) the spatial analytics and encoding are not facile in terms of querying and calling data, and require special encoding rules; and (3) the database is not automatically updated as the physical location changes.
In application systems that use a relational database to store information, there are numerous multi-dimensional queries. This kind of queries provide multi-dimensional query rules for users to follow, and what the users want is to find information in a simple, fast and smart manner. To this end, databases have been optimized for query processing in the following ways: (1) reasonable use of indexes wherein separate and orderly storage structures are created for arranging data in a relational database by queried field, thereby improving query processing performance; (2) redundant relational data: wherein information from correlation tables is stored in a separate bivariate table as redundancy, thereby reducing association relationship during query processing and improving query processing performance; and (3) separate storage of big data, wherein big data is divided and separately stored by data type, thereby improving query processing performance.
China Patent No. CN100483411C discloses an information retrieval method of a relational database comprising the steps of: building a strategy tree for dimensional reduction and placing it in a database system, wherein the strategy tree for dimensional reduction includes at least one sub-node and at least one root node, each sub-node containing at least the current node identification number, the query condition combination and lower sub-node number identification; when a query obeying a query rule made to said database does not yield the desired data, building new query rules successively according to the strategy tree for dimensional reduction; performing retrieval in the database according to the new query rules until the desired data is obtained or until dimensional reduction reaches the root node of the strategy tree and no information on the desired data is reported. The prior patent is however not easy to use. In particular, number-based ID information is required for querying and calling data. In the world of industrial process control, there are so many parameters for equipment and processes in terms of both type and quantity, but querying data by number is awkward. This has long been a problem in applications of traditional relational database that every object needs a unique ID for its data to be found through retrieval. It is thus believed that a method allowing retrieval to be performed using a certain location of equipment or using the time point of a certain process parameter would make data retrieval more efficient.
As described previously, the existing database structures are all built with a series of complicated defining or value-assigning procedures. Thus, input or output of data is impossible without a dedicated program written in a programming language by the original programmer. Besides, software maintenance or upgrade of the database can only be done using source codes provided by the original programmer, and a user has to enter specific ID when trying to query or call data in the database. Therefore, there is a need for a more convenient, efficient and low-cost database system that can improve performance of existing databases and can be realized through configuration.
Spatial-temporal database models used nowadays primarily are sequent snapshots, spatial-temporal cube models, base state with amendments models, and space-time composite models. These models each have characteristics as well as strengths and weaknesses, yet none of them is perfect for statistical applications. Some concepts of spatial-temporal database models, such as the idea about object-oriented spatial-temporal models, feature-based spatial-temporal database models, event-based spatial-temporal database models and the like, use either an object-oriented approach or a variation-based method to record spatial changes and relations. Nevertheless, these known schemes are somehow insufficient to deal with the complicated indexes and numerous statistic levels in a spatial-temporal database, and fail to meet the demands of statistics divisions in terms of business adaptability.
China Patent No. CN103678712A discloses a disaster information spatial-temporal database that includes three information databases, namely a disaster current situation database; a disaster process database and a disaster historical database, a unified coding module carrying out layered coding on the received disaster information data; an attribute data management module and a space position management module introducing disaster information attribute data and space position data to the corresponding disaster information database; a logic conversion module allowing the disaster information data to be transmitted among all disaster information databases; and a spatial-temporal database index module building updating index for the disaster information spatial-temporal databases according to time sequence. The logic conversion module and the spatial-temporal database index module form the basis of the disaster information spatial-temporal database so as to achieve management and maintenance of the disaster attributes, conversion and maintenance of the spatial-temporal logic indexes, entry, retrieval and spatial-temporal inquiries of the statistics data. The shortcomings of the prior patent include: (1) it is impossible to directly conduct search in the relational database by entering temporal or spatial information; and (2) the retrieval is limited to a specific temporal range, and retrieval in a spatial range is impossible.
Currently, most spatial databases support spatial information by means of stored coordinate information, and use a self-growing ID (Identity) for indexing, so spatial structure algorithms are essential for data search. As solutions to the foregoing problem, many patents have tried to use simpler spatial indexing methods.
China Patent No. CN102622349B discloses a method for processing a positional information database that includes: obtaining a spatial position coordinate data; generating spatial position information encoding corresponding to the spatial position based on the coordinate data, comprising: defining a five-section spatial position information encoding rule applied to the geographical territory of China that is embodied as Country code—Area code: Subcode 1: Subcode 2—Additional code. The encoding rule implements a top-down principle, left-right numbering principle. A spatial position information database stores the spatial location information codes as indexes and position information of the spatial locations in the database. The shortcomings of the prior patent include: (1) the spatial description is not accurate and precise enough, particularly not distinctive for the top and bottom sections of some equipment in a factory; (2) the spatial analytics and encoding are not facile in terms of querying and calling data, and require special encoding rules; and (3) the database is not automatically updated as the physical location changes.
In application systems that use a relational database to store information, there are numerous multi-dimensional queries. This kind of queries provide multi-dimensional query rules for users to follow, and what the users want is to find information in a simple, fast and smart manner. To this end, databases have been optimized for query processing in the following ways: (1) reasonable use of indexes wherein separate and orderly storage structures are created for arranging data in a relational database by queried field, thereby improving query processing performance; (2) redundant relational data: wherein information from correlation tables is stored in a separate bivariate table as redundancy, thereby reducing association relationship during query processing and improving query processing performance; and (3) separate storage of big data, wherein big data is divided and separately stored by data type, thereby improving query processing performance.
China Patent No. CN100483411C discloses an information retrieval method of a relational database comprising the steps of: building a strategy tree for dimensional reduction and placing it in a database system, wherein the strategy tree for dimensional reduction includes at least one sub-node and at least one root node, each sub-node containing at least the current node identification number, the query condition combination and lower sub-node number identification; when a query obeying a query rule made to said database does not yield the desired data, building new query rules successively according to the strategy tree for dimensional reduction; performing retrieval in the database according to the new query rules until the desired data is obtained or until dimensional reduction reaches the root node of the strategy tree and no information on the desired data is reported. The prior patent is however not easy to use. In particular, number-based ID information is required for querying and calling data. In the world of industrial process control, there are so many parameters for equipment and processes in terms of both type and quantity, but querying data by number is awkward. This has long been a problem in applications of traditional relational database that every object needs a unique ID for its data to be found through retrieval. It is thus believed that a method allowing retrieval to be performed using a certain location of equipment or using the time point of a certain process parameter would make data retrieval more efficient.
As described previously, the existing database structures are all built with a series of complicated defining or value-assigning procedures. Thus, input or output of data is impossible without a dedicated program written in a programming language by the original programmer. Besides, software maintenance or upgrade of the database can only be done using source codes provided by the original programmer, and a user has to enter specific ID when trying to query or call data in the database. Therefore, there is a need for a more convenient, efficient and low-cost database system that can improve performance of existing databases and can be realized through configuration.
Spatial-temporal database models used nowadays primarily are sequent snapshots, spatial-temporal cube models, base state with amendments models, and space-time composite models. These models each have characteristics as well as strengths and weaknesses, yet none of them is perfect for statistical applications. Some concepts of spatial-temporal database models, such as the idea about object-oriented spatial-temporal models, feature-based spatial-temporal database models, event-based spatial-temporal database models and the like, use either an object-oriented approach or a variation-based method to record spatial changes and relations. Nevertheless, these known schemes are somehow insufficient to deal with the complicated indexes and numerous statistic levels in a spatial-temporal database, and fail to meet the demands of statistics divisions in terms of business adaptability.
China Patent No. CN103678712A discloses a disaster information spatial-temporal database that includes three information databases, namely a disaster current situation database; a disaster process database and a disaster historical database, a unified coding module carrying out layered coding on the received disaster information data; an attribute data management module and a space position management module introducing disaster information attribute data and space position data to the corresponding disaster information database; a logic conversion module allowing the disaster information data to be transmitted among all disaster information databases; and a spatial-temporal database index module building updating index for the disaster information spatial-temporal databases according to time sequence. The logic conversion module and the spatial-temporal database index module form the basis of the disaster information spatial-temporal database so as to achieve management and maintenance of the disaster attributes, conversion and maintenance of the spatial-temporal logic indexes, entry, retrieval and spatial-temporal inquiries of the statistics data. The shortcomings of the prior patent include: (1) it is impossible to directly conduct search in the relational database by entering temporal or spatial information; and (2) the retrieval is limited to a specific temporal range, and retrieval in a spatial range is impossible.
Currently, most spatial databases support spatial information by means of stored coordinate information, and use a self-growing ID (Identity) for indexing, so spatial structure algorithms are essential for data search. As solutions to the foregoing problem, many patents have tried to use simpler spatial indexing methods.
China Patent No. CN102622349B discloses a method for processing a positional information database that includes: obtaining a spatial position coordinate data; generating spatial position information encoding corresponding to the spatial position based on the coordinate data, comprising: defining a five-section spatial position information encoding rule applied to the geographical territory of China that is embodied as Country code—Area code: Subcode 1: Subcode 2—Additional code. The encoding rule implements a top-down principle, left-right numbering principle. A spatial position information database stores the spatial location information codes as indexes and position information of the spatial locations in the database. The shortcomings of the prior patent include: (1) the spatial description is not accurate and precise enough, particularly not distinctive for the top and bottom sections of some equipment in a factory; (2) the spatial analytics and encoding are not facile in terms of querying and calling data, and require special encoding rules; and (3) the database is not automatically updated as the physical location changes.
In application systems that use a relational database to store information, there are numerous multi-dimensional queries. This kind of queries provide multi-dimensional query rules for users to follow, and what the users want is to find information in a simple, fast and smart manner. To this end, databases have been optimized for query processing in the following ways: (1) reasonable use of indexes wherein separate and orderly storage structures are created for arranging data in a relational database by queried field, thereby improving query processing performance; (2) redundant relational data: wherein information from correlation tables is stored in a separate bivariate table as redundancy, thereby reducing association relationship during query processing and improving query processing performance; and (3) separate storage of big data, wherein big data is divided and separately stored by data type, thereby improving query processing performance.
China Patent No. CN100483411C discloses an information retrieval method of a relational database comprising the steps of: building a strategy tree for dimensional reduction and placing it in a database system, wherein the strategy tree for dimensional reduction includes at least one sub-node and at least one root node, each sub-node containing at least the current node identification number, the query condition combination and lower sub-node number identification; when a query obeying a query rule made to said database does not yield the desired data, building new query rules successively according to the strategy tree for dimensional reduction; performing retrieval in the database according to the new query rules until the desired data is obtained or until dimensional reduction reaches the root node of the strategy tree and no information on the desired data is reported. The prior patent is however not easy to use. In particular, number-based ID information is required for querying and calling data. In the world of industrial process control, there are so many parameters for equipment and processes in terms of both type and quantity, but querying data by number is awkward. This has long been a problem in applications of traditional relational database that every object needs a unique ID for its data to be found through retrieval. It is thus believed that a method allowing retrieval to be performed using a certain location of equipment or using the time point of a certain process parameter would make data retrieval more efficient.
As described previously, the existing database structures are all built with a series of complicated defining or value-assigning procedures. Thus, input or output of data is impossible without a dedicated program written in a programming language by the original programmer. Besides, software maintenance or upgrade of the database can only be done using source codes provided by the original programmer, and a user has to enter specific ID when trying to query or call data in the database. Therefore, there is a need for a more convenient, efficient and low-cost database system that can improve performance of existing databases and can be realized through configuration.
Spatial-temporal database models used nowadays primarily are sequent snapshots, spatial-temporal cube models, base state with amendments models, and space-time composite models. These models each have characteristics as well as strengths and weaknesses, yet none of them is perfect for statistical applications. Some concepts of spatial-temporal database models, such as the idea about object-oriented spatial-temporal models, feature-based spatial-temporal database models, event-based spatial-temporal database models and the like, use either an object-oriented approach or a variation-based method to record spatial changes and relations. Nevertheless, these known schemes are somehow insufficient to deal with the complicated indexes and numerous statistic levels in a spatial-temporal database, and fail to meet the demands of statistics divisions in terms of business adaptability.
China Patent No. CN103678712A discloses a disaster information spatial-temporal database that includes three information databases, namely a disaster current situation database; a disaster process database and a disaster historical database, a unified coding module carrying out layered coding on the received disaster information data; an attribute data management module and a space position management module introducing disaster information attribute data and space position data to the corresponding disaster information database; a logic conversion module allowing the disaster information data to be transmitted among all disaster information databases; and a spatial-temporal database index module building updating index for the disaster information spatial-temporal databases according to time sequence. The logic conversion module and the spatial-temporal database index module form the basis of the disaster information spatial-temporal database so as to achieve management and maintenance of the disaster attributes, conversion and maintenance of the spatial-temporal logic indexes, entry, retrieval and spatial-temporal inquiries of the statistics data. The shortcomings of the prior patent include: (1) it is impossible to directly conduct search in the relational database by entering temporal or spatial information; and (2) the retrieval is limited to a specific temporal range, and retrieval in a spatial range is impossible.
Currently, most spatial databases support spatial information by means of stored coordinate information, and use a self-growing ID (Identity) for indexing, so spatial structure algorithms are essential for data search. As solutions to the foregoing problem, many patents have tried to use simpler spatial indexing methods.
China Patent No. CN102622349B discloses a method for processing a positional information database that includes: obtaining a spatial position coordinate data; generating spatial position information encoding corresponding to the spatial position based on the coordinate data, comprising: defining a five-section spatial position information encoding rule applied to the geographical territory of China that is embodied as Country code—Area code: Subcode 1: Subcode 2—Additional code. The encoding rule implements a top-down principle, left-right numbering principle. A spatial position information database stores the spatial location information codes as indexes and position information of the spatial locations in the database. The shortcomings of the prior patent include: (1) the spatial description is not accurate and precise enough, particularly not distinctive for the top and bottom sections of some equipment in a factory; (2) the spatial analytics and encoding are not facile in terms of querying and calling data, and require special encoding rules; and (3) the database is not automatically updated as the physical location changes.
In application systems that use a relational database to store information, there are numerous multi-dimensional queries. This kind of queries provide multi-dimensional query rules for users to follow, and what the users want is to find information in a simple, fast and smart manner. To this end, databases have been optimized for query processing in the following ways: (1) reasonable use of indexes wherein separate and orderly storage structures are created for arranging data in a relational database by queried field, thereby improving query processing performance; (2) redundant relational data: wherein information from correlation tables is stored in a separate bivariate table as redundancy, thereby reducing association relationship during query processing and improving query processing performance; and (3) separate storage of big data, wherein big data is divided and separately stored by data type, thereby improving query processing performance.
China Patent No. CN100483411C discloses an information retrieval method of a relational database comprising the steps of: building a strategy tree for dimensional reduction and placing it in a database system, wherein the strategy tree for dimensional reduction includes at least one sub-node and at least one root node, each sub-node containing at least the current node identification number, the query condition combination and lower sub-node number identification; when a query obeying a query rule made to said database does not yield the desired data, building new query rules successively according to the strategy tree for dimensional reduction; performing retrieval in the database according to the new query rules until the desired data is obtained or until dimensional reduction reaches the root node of the strategy tree and no information on the desired data is reported. The prior patent is however not easy to use. In particular, number-based ID information is required for querying and calling data. In the world of industrial process control, there are so many parameters for equipment and processes in terms of both type and quantity, but querying data by number is awkward. This has long been a problem in applications of traditional relational database that every object needs a unique ID for its data to be found through retrieval. It is thus believed that a method allowing retrieval to be performed using a certain location of equipment or using the time point of a certain process parameter would make data retrieval more efficient.
As described previously, the existing database structures are all built with a series of complicated defining or value-assigning procedures. Thus, input or output of data is impossible without a dedicated program written in a programming language by the original programmer. Besides, software maintenance or upgrade of the database can only be done using source codes provided by the original programmer, and a user has to enter specific ID when trying to query or call data in the database. Therefore, there is a need for a more convenient, efficient and low-cost database system that can improve performance of existing databases and can be realized through configuration.
Spatial-temporal database models used nowadays primarily are sequent snapshots, spatial-temporal cube models, base state with amendments models, and space-time composite models. These models each have characteristics as well as strengths and weaknesses, yet none of them is perfect for statistical applications. Some concepts of spatial-temporal database models, such as the idea about object-oriented spatial-temporal models, feature-based spatial-temporal database models, event-based spatial-temporal database models and the like, use either an object-oriented approach or a variation-based method to record spatial changes and relations. Nevertheless, these known schemes are somehow insufficient to deal with the complicated indexes and numerous statistic levels in a spatial-temporal database, and fail to meet the demands of statistics divisions in terms of business adaptability.
China Patent No. CN103678712A discloses a disaster information spatial-temporal database that includes three information databases, namely a disaster current situation database; a disaster process database and a disaster historical database, a unified coding module carrying out layered coding on the received disaster information data; an attribute data management module and a space position management module introducing disaster information attribute data and space position data to the corresponding disaster information database; a logic conversion module allowing the disaster information data to be transmitted among all disaster information databases; and a spatial-temporal database index module building updating index for the disaster information spatial-temporal databases according to time sequence. The logic conversion module and the spatial-temporal database index module form the basis of the disaster information spatial-temporal database so as to achieve management and maintenance of the disaster attributes, conversion and maintenance of the spatial-temporal logic indexes, entry, retrieval and spatial-temporal inquiries of the statistics data. The shortcomings of the prior patent include: (1) it is impossible to directly conduct search in the relational database by entering temporal or spatial information; and (2) the retrieval is limited to a specific temporal range, and retrieval in a spatial range is impossible.
Currently, most spatial databases support spatial information by means of stored coordinate information, and use a self-growing ID (Identity) for indexing, so spatial structure algorithms are essential for data search. As solutions to the foregoing problem, many patents have tried to use simpler spatial indexing methods.
China Patent No. CN102622349B discloses a method for processing a positional information database that includes: obtaining a spatial position coordinate data; generating spatial position information encoding corresponding to the spatial position based on the coordinate data, comprising: defining a five-section spatial position information encoding rule applied to the geographical territory of China that is embodied as Country code—Area code: Subcode 1: Subcode 2—Additional code. The encoding rule implements a top-down principle, left-right numbering principle. A spatial position information database stores the spatial location information codes as indexes and position information of the spatial locations in the database. The shortcomings of the prior patent include: (1) the spatial description is not accurate and precise enough, particularly not distinctive for the top and bottom sections of some equipment in a factory; (2) the spatial analytics and encoding are not facile in terms of querying and calling data, and require special encoding rules; and (3) the database is not automatically updated as the physical location changes.
In application systems that use a relational database to store information, there are numerous multi-dimensional queries. This kind of queries provide multi-dimensional query rules for users to follow, and what the users want is to find information in a simple, fast and smart manner. To this end, databases have been optimized for query processing in the following ways: (1) reasonable use of indexes wherein separate and orderly storage structures are created for arranging data in a relational database by queried field, thereby improving query processing performance; (2) redundant relational data: wherein information from correlation tables is stored in a separate bivariate table as redundancy, thereby reducing association relationship during query processing and improving query processing performance; and (3) separate storage of big data, wherein big data is divided and separately stored by data type, thereby improving query processing performance.
China Patent No. CN100483411C discloses an information retrieval method of a relational database comprising the steps of: building a strategy tree for dimensional reduction and placing it in a database system, wherein the strategy tree for dimensional reduction includes at least one sub-node and at least one root node, each sub-node containing at least the current node identification number, the query condition combination and lower sub-node number identification; when a query obeying a query rule made to said database does not yield the desired data, building new query rules successively according to the strategy tree for dimensional reduction; performing retrieval in the database according to the new query rules until the desired data is obtained or until dimensional reduction reaches the root node of the strategy tree and no information on the desired data is reported. The prior patent is however not easy to use. In particular, number-based ID information is required for querying and calling data. In the world of industrial process control, there are so many parameters for equipment and processes in terms of both type and quantity, but querying data by number is awkward. This has long been a problem in applications of traditional relational database that every object needs a unique ID for its data to be found through retrieval. It is thus believed that a method allowing retrieval to be performed using a certain location of equipment or using the time point of a certain process parameter would make data retrieval more efficient.
As described previously, the existing database structures are all built with a series of complicated defining or value-assigning procedures. Thus, input or output of data is impossible without a dedicated program written in a programming language by the original programmer. Besides, software maintenance or upgrade of the database can only be done using source codes provided by the original programmer, and a user has to enter specific ID when trying to query or call data in the database. Therefore, there is a need for a more convenient, efficient and low-cost database system that can improve performance of existing databases and can be realized through configuration.
China Patent No. CN103678712A discloses a disaster information spatial-temporal database that includes three information databases, namely a disaster current situation database; a disaster process database and a disaster historical database, a unified coding module carrying out layered coding on the received disaster information data; an attribute data management module and a space position management module introducing disaster information attribute data and space position data to the corresponding disaster information database; a logic conversion module allowing the disaster information data to be transmitted among all disaster information databases; and a spatial-temporal database index module building updating index for the disaster information spatial-temporal databases according to time sequence. The logic conversion module and the spatial-temporal database index module form the basis of the disaster information spatial-temporal database so as to achieve management and maintenance of the disaster attributes, conversion and maintenance of the spatial-temporal logic indexes, entry, retrieval and spatial-temporal inquiries of the statistics data. The shortcomings of the prior patent include: (1) it is impossible to directly conduct search in the relational database by entering temporal or spatial information; and (2) the retrieval is limited to a specific temporal range, and retrieval in a spatial range is impossible.
Currently, most spatial databases support spatial information by means of stored coordinate information, and use a self-growing ID (Identity) for indexing, so spatial structure algorithms are essential for data search. As solutions to the foregoing problem, many patents have tried to use simpler spatial indexing methods.
China Patent No. CN102622349B discloses a method for processing a positional information database that includes: obtaining a spatial position coordinate data; generating spatial position information encoding corresponding to the spatial position based on the coordinate data, comprising: defining a five-section spatial position information encoding rule applied to the geographical territory of China that is embodied as Country code—Area code: Subcode 1: Subcode 2—Additional code. The encoding rule implements a top-down principle, left-right numbering principle. A spatial position information database stores the spatial location information codes as indexes and position information of the spatial locations in the database. The shortcomings of the prior patent include: (1) the spatial description is not accurate and precise enough, particularly not distinctive for the top and bottom sections of some equipment in a factory; (2) the spatial analytics and encoding are not facile in terms of querying and calling data, and require special encoding rules; and (3) the database is not automatically updated as the physical location changes.
In application systems that use a relational database to store information, there are numerous multi-dimensional queries. This kind of queries provide multi-dimensional query rules for users to follow, and what the users want is to find information in a simple, fast and smart manner. To this end, databases have been optimized for query processing in the following ways: (1) reasonable use of indexes wherein separate and orderly storage structures are created for arranging data in a relational database by queried field, thereby improving query processing performance; (2) redundant relational data: wherein information from correlation tables is stored in a separate bivariate table as redundancy, thereby reducing association relationship during query processing and improving query processing performance; and (3) separate storage of big data, wherein big data is divided and separately stored by data type, thereby improving query processing performance.
China Patent No. CN100483411C discloses an information retrieval method of a relational database comprising the steps of: building a strategy tree for dimensional reduction and placing it in a database system, wherein the strategy tree for dimensional reduction includes at least one sub-node and at least one root node, each sub-node containing at least the current node identification number, the query condition combination and lower sub-node number identification; when a query obeying a query rule made to said database does not yield the desired data, building new query rules successively according to the strategy tree for dimensional reduction; performing retrieval in the database according to the new query rules until the desired data is obtained or until dimensional reduction reaches the root node of the strategy tree and no information on the desired data is reported. The prior patent is however not easy to use. In particular, number-based ID information is required for querying and calling data. In the world of industrial process control, there are so many parameters for equipment and processes in terms of both type and quantity, but querying data by number is awkward. This has long been a problem in applications of traditional relational database that every object needs a unique ID for its data to be found through retrieval. It is thus believed that a method allowing retrieval to be performed using a certain location of equipment or using the time point of a certain process parameter would make data retrieval more efficient.
As described previously, the existing database structures are all built with a series of complicated defining or value-assigning procedures. Thus, input or output of data is impossible without a dedicated program written in a programming language by the original programmer. Besides, software maintenance or upgrade of the database can only be done using source codes provided by the original programmer, and a user has to enter specific ID when trying to query or call data in the database. Therefore, there is a need for a more convenient, efficient and low-cost database system that can improve performance of existing databases and can be realized through configuration.

Method for retrieving data object based on spatial-temporal database