Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 6,690 papers for “Database transaction”

Database transaction sample.

Iyad Aqra (4781664), Tutut Herawan (787202), Norjihan Abdul Ghani (4781670) et al. · Figshare · 2018

Cited by 0Open access

Dataset, transaction database.

Iyad Aqra (4781664), Tutut Herawan (787202), Norjihan Abdul Ghani (4781670) et al. · Figshare · 2018

Cited by 0Open access

Autonomous Temporal Transaction Database

Michal Kvet · SHILAP Revista de lepidopterología · 2021

The data amount to be handled, managed, and evaluated is enormous. Intelligent information systems need to cover not just conventional data types. The whole evolution should be addressed instead. Cloud environment offers a wide range of opportunities pointing to the scalability of the solution. Oracle Cloud databases are based on the autonomous processing of the system administration done by machine learning and artificial intelligence. Autonomous database processing core element states mainly just the transaction control of the current valid states. In this paper, we deal with the temporal architectures pointing to the object, attribute and synchronization group granularity. The internal representation must be currently defined by the user explicitly. Our proposed solution is fully autonomous, covered by the Oracle Cloud technology. User just register the structure to be managed temporaly, granularity is maintained by the system, following the complexity and scalability of the solution. Data management is extended by the Granularity strategy management module to ensure either storage efficiency, as well as the format of the query result set. Introduced DBMS_AUT_TEMPORALITY package registers the data to the temporal sphere and limits the historical data reflecting the information value.

Cited by 5Open access

A sample transaction database.

Loan T. T. Nguyen (20660789), Hoa Duong (20660792), An Mai (20660795) et al. · Figshare · 2025

<div> Privacy is as a critical issue in the age of data. Organizations and corporations who publicly share their data always have a major concern that their sensitive information may be leaked or extracted by rivals or attackers using data miners. High-utility itemset mining (HUIM) is an extension to frequent itemset mining (FIM) which deals with business data in the form of transaction databases, data that is also in danger of being stolen. To deal with this, a number of privacy-preserving data mining (PPDM) techniques have been introduced. An important topic in PPDM in the recent years is privacy-preserving utility mining (PPUM). The goal of PPUM is to protect the sensitive information, such as sensitive high-utility itemsets, in transaction databases, and make them undiscoverable for data mining techniques. However, available PPUM methods do not consider the generalization of items in databases (categories, classes, groups, etc.). These algorithms only consider the items at a specialized level, leaving the item combinations at a higher level vulnerable to attacks. The insights gained from higher abstraction levels are somewhat more valuable than those from lower levels since they contain the outlines of the data. To address this issue, this work suggests two PPUM algorithms, namely <b>MLHProtector</b> and <b>FMLHProtector</b>, to operate at all abstraction levels in a transaction database to protect them from data mining algorithms. Empirical experiments showed that both algorithms successfully protect the itemsets from being compromised by attackers. </div>

Cited by 0Open access

Testing Database Transaction Concurrency

2008

Database application programs are often designed to be executed concurrently by many clients. By grouping related database queries into transactions, DBMS systems can guarantee that each transaction satisfies the well-known ACID properties: Atomicity, Consistency, Isolation, and Durability. However, if a database application is decomposed into transactions in an incorrect manner, the application may fail when executed concurrently due to potential offline concurrency problems. This paper presents a dataflow analysis technique for identifying schedules of transaction execution aimed at revealing concurrency faults of this nature, along with techniques for controlling the DBMS or the application to force execution to follow these transaction sequences. The techniques have been integrated into AGENDA, a tool set for testing relational database application programs. Preliminary empirical evaluation is presented. 1.

Cited by 0

Testing database transaction consistency

Yuetang Deng, Phyllis Frankl · 2003

AGENDA is a tool set for testing relational database applications. In this paper we extend AGENDA to test transaction consistency. Two levels of checks are used to check both database state and state transition. The transition check validates the state transition performed by the transaction. The state check validates that the overall global consistency properties hold for the new database state. Our tool set can handle general SQL assertions that are defined in the SQL standard but are not supported by current DBMSs, such as constraints involving multiple tables and SQL aggregration functions. A test generation heuristic that takes account of certain constraints is also presented. A case study based on the TPC-C benchmark shows promising results. 1.

Cited by 0

Courseware for Database Transaction Processing

Dung Nguyen Tien · Digital Repository (National Repository of Grey Literature) · 2007

The task of the bachelor work is to give a proposal and its implementation of a transaction processing application for teaching purpose. The program enables parallel transaction processing simulation, it works with a simple database in the memory. Transaction processing is scheduled automatically or by user. The processing provides single step operation, this means the user is also able to see actual states of the database. It supports serializability tests, lock protocols and deadlock precaution.

Cited by 0

Transaction-Based Grid Database Replication

Yin Chen, Dave Berry, Patrick Dantressangle · 2012

We present a framework for grid database replication. Data replication is one of the most useful strategies to achieve high levels of availability and fault tolerance as well as minimal access time in grids. It is commonly demanded by many grid applications. However, most existing grid replication systems only deal with read-only files. By contrast, several relational database vendors provide tools that offer transaction-based replication, but the capabilities of these products are insufficient to address grid issues. They lack scalability and cannot cope with the heterogeneous nature of grid resources. Our approach uses existing grid mechanisms to provide a metadata registry and to make initial replicas of data resources. We then define high-level APIs for managing transaction-based replication. These APIs can be mapped to a variety of relational database replication mechanisms allowing us to use existing vendor-specific solutions. The next stage in the project will use OGSA-DAI to manage replication across multiple domains. In this way, our framework can support transaction-based database synchronisation that maintains consistency in a data-intensive, largescale distributed, disparate networking environment. 1.

Cited by 0

Accelerating BFT Database with Transaction Reconstruction

Aoi Kida, Hideyuki Kawashima · 2024

Data stores utilized in modern data-intensive applications are expected to demonstrate rapid read and write capabilities and robust fault tolerance. Byzantine fault-tolerant database (BFT database) can execute transactions concurrently and tolerate arbitrary faults (Byzantine fault). We consider cryptographic and communication processing as performance bottlenecks in the transaction processing of BFT databases. This paper presents a transaction reconstruction method, re-constructing a single transaction from multiple transactions to streamline cryptographic and communication processes. We evaluated the proposed method with Basil (state-of-the-art BFT database) in experiments. In an environment where nodes are geographically centralized, the proposed method demonstrates up to approximately 2.5 times higher throughput and reduces latency by up to about 30% than vanilla Basil. In an environment where nodes are geographically distributed, the proposed method demonstrates up to approximately 50 times higher throughput and reduces latency by up to about 75% than vanilla Basil.

Cited by 0

Indexing a transaction-decision time database

Mário A. Nascimento, Margaret H. Dunham · 1996

Although most of the research found in the temporal database literature recognizes the need to support valid time and transaction time as temporal attributes, only a few papers have recognized the role of decision (or event) time. Moreover, no indexing technique which encompasses decision time has been presented in the literature. We aim to fill this void by presenting an indexing structure that is able to index both transaction time and decision time under the same framework. This structure is based on a B+-tree. An extension to the proposed structure is presented to more efficiently handle the case where non-temporal data is also used in queries.

Cited by 5Open access

Automatic verification of database transaction safety

Tim Sheard, David Stemple · ACM Transactions on Database Systems · 1989

Maintaining the integrity of databases is one of the promises of database management systems. This includes assuring that integrity constraints are invariants of database transactions. This is very difficult to accomplish efficiently in the presence of complex constraints and large amounts of data. One way to minimize the amount of processing required to maintain database integrity over transaction processing is to prove at compile-time that transactions cannot, if run atomically, disobey integrity constraints. We report on a system that performs such verification for a robust set of constraint and transaction classes. The system accepts database schemas written in a more or less traditional style and accepts programs in a high-level programming language. Automatic verification fast enough to be effective on current workstation hardware is performed.

Cited by 124Open access