In distributed databases for general-purpose business software, such as groupware, the asynchronous replication update method is widely employed to assure coincidence in the contents of the database; the replications ...
详细信息
The design of a molecular dynamics trajectory database is presented as an example of the organization of large-scale dynamic distributed repositories for scientific data. Large scientific datasets are usually interpre...
详细信息
The design of a molecular dynamics trajectory database is presented as an example of the organization of large-scale dynamic distributed repositories for scientific data. Large scientific datasets are usually interpreted through reduced data calculated by analysis functions. This allows a database architecture in which the analyzed datasets, that are kept in addition to the raw datasets, are transferred to a database user. A flexible user interface with a well defined Application Program Interface (API) allows for a wide array of analysis functions and the incorporation of user defined functions is a critical part of the database design. An analysis function is executed only when the requested analysis result is not available from an earlier request. A prototype implementation used to gain initial practical experiences with performance and scalability is presented. (C) 1999 Elsevier Science B.V. All rights reserved.
Space-based optical observation is assuming an increasingly significant role in space surveillance and tracking. However, it often yields tracks that are too short, which are known as too short arcs (TSAs). A single T...
详细信息
Space-based optical observation is assuming an increasingly significant role in space surveillance and tracking. However, it often yields tracks that are too short, which are known as too short arcs (TSAs). A single TSA lacks sufficient information for reliable initial orbit determination of a resident space object. Therefore, it is typically necessary to perform tracklet association during catalog building and maintenance. This study presents a novel tracklet association method that improves upon existing techniques by combining admissible regions and nonlinear orbital uncertainty propagation. Proceeding by constructing TSA association matrices and TSA clustering matrices, the bond energy algorithm, traditionally employed in the design of distributed database systems, is applied to cluster TSAs based on the association results between two arbitrary TSAs. Furthermore, the proposed splitting algorithm reduces the computational load associated with clustering multiple tracklets and effectively handles erroneous association results. To assess the effectiveness of this approach, it was tested in a space-based optical-survey scenario, accounting for practical observation uncertainties. The simulation results demonstrate that the method achieves a high level of accuracy in both TSA association and clustering.
distributed in-memory databases are widely adopted to achieve low latency and high bandwidth for data-intensive applications. They support scale-out by sharding and distributing data across multiple nodes. To efficien...
详细信息
distributed in-memory databases are widely adopted to achieve low latency and high bandwidth for data-intensive applications. They support scale-out by sharding and distributing data across multiple nodes. To efficiently adapt to various workloads, distributed in-memory databases must be capable of migrating shards across nodes. In this paper, we demonstrate that state-of-the-art approaches experience significant performance degradation during migration due to service downtime and redundant data transfer. Furthermore, our findings indicate that the presence of service downtime constrains the scalability of migration strategies, while the transfer of redundant data during the snapshot transfer phase limits their adaptability to dynamic workloads. To this end, this paper proposes Aion, a live migration strategy designed for distributed in-memory databases. Aion eliminates any potential service downtime by immediately switching transaction routing to the destination node. To ensure data consistency between the source and destination nodes, as well as serializable execution during migration, Aion proposes the mutual validation phase. Moreover, Aion introduces an analysis phase before the snapshot transfer phase to identify dynamically changing hotspots in workloads. The analysis phase identifies and transfers tuples and versions accessed less frequently to the destination node, reducing the amount of data transferred. Aion is implemented on a distributed in-memory database and evaluated using various OLTP workloads. The results demonstrate that Aion can fundamentally eliminate service downtime, adapt effectively to various workloads and exhibit robust scalability. Compared to state-of-the-art approaches, Aion achieves up to 2.25x-6.57x higher throughput during migration and shortens the migration duration by 53.7-68.2%.
Recently, a fast increment of spatio-temporal data volume has been achieved and more importantly the data might distribute everywhere. So, there is a need for spatio-temporal data mining systems that are able to suppo...
详细信息
ISBN:
(纸本)9783540725879
Recently, a fast increment of spatio-temporal data volume has been achieved and more importantly the data might distribute everywhere. So, there is a need for spatio-temporal data mining systems that are able to support such distributed spatio-temporal query and analysis operations. distributed spatio-temporal data mining technologies were discussed in this paper. After discussing the process of spatio-temporal data mining in distributed environment, one actual DSTDMS (distributed Spatio-Temporal Data Mining System) was designed and then implemented. The system is based on data model of sequent snapshot and accomplished through spatio-temporal extension on PostgreSQL. Various spatio-temporal analyses and mining queries could be carried out in the system through simple SQL statements. By using the system, effective mining of distributed spatio-temporal data were achieved.
A1 is an in-memory distributed database used by the Bing search engine to support complex queries over structured data. The key enablers for A1 are availability of cheap DRAM and high speed RDMA (Remote Direct Memory ...
详细信息
ISBN:
(纸本)9781450367356
A1 is an in-memory distributed database used by the Bing search engine to support complex queries over structured data. The key enablers for A1 are availability of cheap DRAM and high speed RDMA (Remote Direct Memory Access) networking in commodity hardware. A1 uses FaRM [11, 12] as its underlying storage layer and builds the graph abstraction and query engine on top. The combination of in-memory storage and RDMA access requires rethinking how data is allocated, organized and queried in a large distributed system. A single A1 cluster can store tens of billions of vertices and edges and support a throughput of 350+ million of vertex reads per second with end to end query latency in single digit milliseconds. In this paper we describe the A1 data model, RDMA optimized data structures and query execution.
Real-time database systems must maintain consistency while minimizing the number of transactions that miss the deadline. To satisfy both the consistency and real-time constraints, there is the need to integrate synchr...
详细信息
In order to reduce the resource occupancy and retrieval efficiency of geological drilling databases, this study proposes a distributed horizontal expansion method for query optimization of geological drilling database...
详细信息
In order to reduce the resource occupancy and retrieval efficiency of geological drilling databases, this study proposes a distributed horizontal expansion method for query optimization of geological drilling databases by constructing a comprehensive geological data subtree, analyzing the characteristics of distributed databases and elements in geological databases, and quickly retrieving data resources based on element attributes. In addition, this study has designed a method to horizontally extend the database designed for drilling holes using a multi-constraint model in order to achieve extension optimization of the distributed geological drilling database. Experiments are conducted to verify the performance and applicability of the proposed method. The experiment shows that when the geological data capacity is 80 GB, the capacity level of the geological database can be extended to 41 x 105TB using the method proposed in this study. The retrieval efficiency is higher than 89% and the resource occupancy rate is lower than 12% after the horizontal expansion of the database. By using this research method, the horizontal expansion of the geological drilling database is more effective, and can effectively reduce the resource occupancy rate and retrieval efficiency of the geological drilling databases. This has value significance for geological drilling with efficiency improvement and development.
Real-time database systems must maintain consistency while minimizing the number of transactions that miss the deadline. To satisfy both the consistency and real-time constraints, there is the need to integrate synchr...
详细信息
Real-time database systems must maintain consistency while minimizing the number of transactions that miss the deadline. To satisfy both the consistency and real-time constraints, there is the need to integrate synchronization protocols with real-time priority scheduling protocols. This paper describes a prototyping environment for investigating distributed real-time database systems, and its use for performance evaluation of priority-based scheduling protocols for real-time database systems.
The objective of this paper is to forecast the performance of transaction under real time distributed system. A real time database system is a transaction processing system design to handle the workload within a deadl...
详细信息
The objective of this paper is to forecast the performance of transaction under real time distributed system. A real time database system is a transaction processing system design to handle the workload within a deadline. The objective of such scheme is to complete the processing of transaction before the deadline expires. The performance of the system depends on the factors such as database system architectures, underlying processors, disks speeds, various operating conditions and workloads. Forecasting the transaction performance depends on the basis of comparing with commit and abort of a transition in the scheme. The output of the present simulation gives the percentage of commit and abort of transaction.
暂无评论