This paper discribes the importance and necessity of the study on the data structures for displaying the mining field using the interactive technology in open pit design and planning,based upon the grid block model. T...This paper discribes the importance and necessity of the study on the data structures for displaying the mining field using the interactive technology in open pit design and planning,based upon the grid block model. The commonly used data structures--rectangular array structure and quadtree structure ,are analyzed. Two compressed data structures--compressed circular link array structure and compressed doubly-linked circular array structure,are proposed,which are much more suitable for displaying the regularly gridded block model. When the two compressed data structures are adopted,the storage space can be tremendously saved and the algorithms are simple,while the requirements of the accuracy and the manipulating speed will be both satisfied for the interactive open pit short range plan formulation.展开更多
In the application development of database,sharing information a- mong different DBMSs is an important and meaningful technical subject. This paper analyzes the schema definition and physical organization of popu- lar...In the application development of database,sharing information a- mong different DBMSs is an important and meaningful technical subject. This paper analyzes the schema definition and physical organization of popu- lar relational DBMSs and suggests the use of an intermediary schema.This technology provides many advantages such as powerful extensibility and ease in the integration of data conversions among different DBMSs etc.This pa- per introduces the data conversion system under DOS and XENIX operating systems.展开更多
The current storage mechanism considered little in data’s keeping characteristics.These can produce fragments of various sizes among data sets.In some cases,these fragments may be serious and harm system performance....The current storage mechanism considered little in data’s keeping characteristics.These can produce fragments of various sizes among data sets.In some cases,these fragments may be serious and harm system performance.In this paper,we manage to modify the current storage mechanism.We introduce an extra storage unit called data bucket into the classical data manage architecture.Next,we modify the data manage mechanism to improve our designs.By keeping data according to their visited information,both the number of fragments and the fragment size are greatly reduced.Considering different data features and storage device conditions,we also improve the solid state drive(SSD)lifetime by keeping data into different spaces.Experiments show that our designs have a positive influence on the SSD storage density and actual service time.展开更多
A multilevel secure relation hierarchical data model for multilevel secure database is extended from the relation hierarchical data model in single level environment in this paper. Based on the model, an upper lowe...A multilevel secure relation hierarchical data model for multilevel secure database is extended from the relation hierarchical data model in single level environment in this paper. Based on the model, an upper lower layer relationalintegrity is presented after we analyze and eliminate the covert channels caused by the database integrity.Two SQL statements are extended to process polyinstantiation in the multilevel secure environment.The system based on the multilevel secure relation hierarchical data model is capable of integratively storing and manipulating complicated objects ( e.g. , multilevel spatial data) and conventional data ( e.g. , integer, real number and character string) in multilevel secure database.展开更多
Modem network security devices employ packet classification and pattern matching algorithms to inspect packets. Due to the complexity and heterogeneity of different search data structures, it is difficult for existing...Modem network security devices employ packet classification and pattern matching algorithms to inspect packets. Due to the complexity and heterogeneity of different search data structures, it is difficult for existing algorithms to leverage modern hardware platforms to achieve high performance. This paper presents a Structural Compression （SC） method that optimizes the data structures of both algorithms. It reviews both algorithms under the model of search space decomposition, and homogenizes their search data structures. This approach not only guarantees deterministic lookup speed but also optimizes the data structure for efficient implementation oi1 many-core platforms. The performance evaluation reveals that the homogeneous data structure achieves 10Gbps line-rate 64byte packet classification throughput and multi-Gbps deep inspection speed.展开更多
An autonomous underwater vehicle (AUV) must use an algorithm to plan its path to distant, mobile offshore objects. Because of the uneven distribution of obstacles in the real world, the efficiency of the algorithm dec...An autonomous underwater vehicle (AUV) must use an algorithm to plan its path to distant, mobile offshore objects. Because of the uneven distribution of obstacles in the real world, the efficiency of the algorithm decreases if the global environment is represented by regular grids with all of them at the highest resolution. The framed quadtree data structure is able to more efficiently represent the environment. When planning the path, the dynamic object is expressed instead as several static objects which are used by the path planner to update the path. By taking account of the characteristics of the framed quadtree, objects can be projected on the frame nodes to increase the precision of the path. Analysis and simulations showed the proposed planner could increase efficiency while improving the ability of the AUV to follow an object.展开更多
XML data can be represented by a tree or graph and the query processing for XML data requires the structural information among nodes. Designing an efficient labeling scheme for the nodes of Order-Sensitive XML trees i...XML data can be represented by a tree or graph and the query processing for XML data requires the structural information among nodes. Designing an efficient labeling scheme for the nodes of Order-Sensitive XML trees is one of the important methods to obtain the excellent management of XML data. Previous labeling schemes such as region and prefix often sacrifice updating performance and suffer increasing labeling space when inserting new nodes. To overcome these limitations, in this paper we propose a new labeling idea of separating structure from order. According to the proposed idea, a novel Prime-based Middle Fraction Labeling Scheme(PMFLS) is designed accordingly, in which a series of algorithms are proposed to obtain the structural relationships among nodes and to support updates. PMFLS combines the advantages of both prefix and region schemes in which the structural information and sequential information are separately expressed. PMFLS also supports Order-Sensitive updates without relabeling or recalculation, and its labeling space is stable. Experiments and analysis on several benchmarks are conducted and the results show that PMFLS is efficient in handling updates and also significantly improves the performance of the query processing with good scalability.展开更多
文摘This paper discribes the importance and necessity of the study on the data structures for displaying the mining field using the interactive technology in open pit design and planning,based upon the grid block model. The commonly used data structures--rectangular array structure and quadtree structure ,are analyzed. Two compressed data structures--compressed circular link array structure and compressed doubly-linked circular array structure,are proposed,which are much more suitable for displaying the regularly gridded block model. When the two compressed data structures are adopted,the storage space can be tremendously saved and the algorithms are simple,while the requirements of the accuracy and the manipulating speed will be both satisfied for the interactive open pit short range plan formulation.
文摘In the application development of database,sharing information a- mong different DBMSs is an important and meaningful technical subject. This paper analyzes the schema definition and physical organization of popu- lar relational DBMSs and suggests the use of an intermediary schema.This technology provides many advantages such as powerful extensibility and ease in the integration of data conversions among different DBMSs etc.This pa- per introduces the data conversion system under DOS and XENIX operating systems.
基金partly supported by the National Natural Science Foundation of China under Grant No.62072076the Research Fund of National Key Laboratory of Computer Architecture under Grant No.CARCH201811。
文摘The current storage mechanism considered little in data’s keeping characteristics.These can produce fragments of various sizes among data sets.In some cases,these fragments may be serious and harm system performance.In this paper,we manage to modify the current storage mechanism.We introduce an extra storage unit called data bucket into the classical data manage architecture.Next,we modify the data manage mechanism to improve our designs.By keeping data according to their visited information,both the number of fragments and the fragment size are greatly reduced.Considering different data features and storage device conditions,we also improve the solid state drive(SSD)lifetime by keeping data into different spaces.Experiments show that our designs have a positive influence on the SSD storage density and actual service time.
文摘A multilevel secure relation hierarchical data model for multilevel secure database is extended from the relation hierarchical data model in single level environment in this paper. Based on the model, an upper lower layer relationalintegrity is presented after we analyze and eliminate the covert channels caused by the database integrity.Two SQL statements are extended to process polyinstantiation in the multilevel secure environment.The system based on the multilevel secure relation hierarchical data model is capable of integratively storing and manipulating complicated objects ( e.g. , multilevel spatial data) and conventional data ( e.g. , integer, real number and character string) in multilevel secure database.
文摘Modem network security devices employ packet classification and pattern matching algorithms to inspect packets. Due to the complexity and heterogeneity of different search data structures, it is difficult for existing algorithms to leverage modern hardware platforms to achieve high performance. This paper presents a Structural Compression （SC） method that optimizes the data structures of both algorithms. It reviews both algorithms under the model of search space decomposition, and homogenizes their search data structures. This approach not only guarantees deterministic lookup speed but also optimizes the data structure for efficient implementation oi1 many-core platforms. The performance evaluation reveals that the homogeneous data structure achieves 10Gbps line-rate 64byte packet classification throughput and multi-Gbps deep inspection speed.
基金Supported by the National Natural Science Foundation of China under Grant No. 60875071
文摘An autonomous underwater vehicle (AUV) must use an algorithm to plan its path to distant, mobile offshore objects. Because of the uneven distribution of obstacles in the real world, the efficiency of the algorithm decreases if the global environment is represented by regular grids with all of them at the highest resolution. The framed quadtree data structure is able to more efficiently represent the environment. When planning the path, the dynamic object is expressed instead as several static objects which are used by the path planner to update the path. By taking account of the characteristics of the framed quadtree, objects can be projected on the frame nodes to increase the precision of the path. Analysis and simulations showed the proposed planner could increase efficiency while improving the ability of the AUV to follow an object.
基金supported by the National Science Foundation of China(Grant No.61272067,61370229)the National Key Technology R&D Program of China(Grant No.2012BAH27F05,2013BAH72B01)+1 种基金the National High Technology R&D Program of China(Grant No.2013AA01A212)the S&T Projects of Guangdong Province(Grant No.2016B010109008,2014B010117007,2015A030401087,2015B010109003,2015B010110002)
文摘XML data can be represented by a tree or graph and the query processing for XML data requires the structural information among nodes. Designing an efficient labeling scheme for the nodes of Order-Sensitive XML trees is one of the important methods to obtain the excellent management of XML data. Previous labeling schemes such as region and prefix often sacrifice updating performance and suffer increasing labeling space when inserting new nodes. To overcome these limitations, in this paper we propose a new labeling idea of separating structure from order. According to the proposed idea, a novel Prime-based Middle Fraction Labeling Scheme(PMFLS) is designed accordingly, in which a series of algorithms are proposed to obtain the structural relationships among nodes and to support updates. PMFLS combines the advantages of both prefix and region schemes in which the structural information and sequential information are separately expressed. PMFLS also supports Order-Sensitive updates without relabeling or recalculation, and its labeling space is stable. Experiments and analysis on several benchmarks are conducted and the results show that PMFLS is efficient in handling updates and also significantly improves the performance of the query processing with good scalability.
