Log in

Relevant bibliographies by topics / Transaction databases

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Transaction databases'

Author: Grafiati

Published: 4 June 2021

Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Transaction databases.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Transaction databases"

1

Mohamed, Asghaiyer. "Network load traffic on MySQL atomic transaction database." Bulletin of Social Informatics Theory and Application 4, no. 1 (April 23, 2020): 35–39. http://dx.doi.org/10.31763/businta.v4i1.188.

Full text

Abstract:

Internet technology is developing very rapidly especially on the database system. Today's database has led to data that cannot be processed into the traditional way that we call big data. Some data stored on the server requires a way for the data to be valid and intact for that transaction mechanism appears on RDBMS which ensures that the data stored will become a unified whole as in customer account data, withdrawal of money at ATMs, e-transactions -commerce and so on. Of course the use of transactions in a database by not using Atomic transactions has a difference in terms of traffic on the network. This research appears by analyzing network traffic or density from a database that uses transactions and not to users who access them. This research method uses a questionnaire method by distributing questionnaires quantitatively to 300 respondents. The results of the study of approximately 300 respondents, researchers get the results that the use of transactions in databases and databases without transactions after being accessed by 300 people, the densest network is a network owned by a system that uses transaction features, this is because there is a slight increase of about 13% of traffic when compared to a network without transactions. This statement shows that two-way communication from a database that has the transaction provides feedback to the user so that the data is reliable as an indicator that the data has been stored safely. Further research can be done by finding other information or a study of big data using the atomic transaction model.

APA, Harvard, Vancouver, ISO, and other styles

2

Mazurova, Oksana, Artem Naboka, and Mariya Shirokopetleva. "RESEARCH OF ACID TRANSACTION IMPLEMENTATION METHODS FOR DISTRIBUTED DATABASES USING REPLICATION TECHNOLOGY." Innovative Technologies and Scientific Solutions for Industries, no. 2 (16) (July 6, 2021): 19–31. http://dx.doi.org/10.30837/itssi.2021.16.019.

Full text

Abstract:

Today, databases are an integral part of most modern applications designed to store large amounts of data and to request from many users. To solve business problems in such conditions, databases are scaled, often horizontally on several physical servers using replication technology. At the same time, many business operations require the implementation of transactional compliance with ACID properties. For relational databases that traditionally support ACID transactions, horizontal scaling is not always effective due to the limitations of the relational model itself. Therefore, there is an applied problem of efficient implementation of ACID transactions for horizontally distributed databases. The subject matter of the study is the methods of implementing ACID transactions in distributed databases, created by replication technology. The goal of the work is to increase the efficiency of ACID transaction implementation for horizontally distributed databases. The work is devoted to solving the following tasks: analysis and selection of the most relevant methods of implementation of distributed ACID transactions; planning and experimental research of methods for implementing ACID transactions by using of NoSQL DBMS MongoDB and NewSQL DBMS VoltDB as an example; measurements of metrics of productivity of use of these methods and formation of the recommendation concerning their effective use. The following methods are used: system analysis; relational databases design; methods for evaluating database performance. The following results were obtained: experimental measurements of the execution time of typical distributed transactions for the subject area of e-commerce, as well as measurements of the number of resources required for their execution; revealed trends in the performance of such transactions, formed recommendations for the methods studied. The obtained results allowed to make functions of dependence of the considered metrics on loading parameters. Conclusions: the strengths and weaknesses of the implementation of distributed ACID transactions using MongoDB and VoltDB were identified. Practical recommendations for the effective use of these systems for different types of applications, taking into account the resources consumed and the types of requests.

APA, Harvard, Vancouver, ISO, and other styles

3

RUSINKIEWICZ, MAREK, PIOTR KRYCHNIAK, and ANDRZEJ CICHOCKI. "TOWARDS A MODEL FOR MULTIDATABASE TRANSACTIONS." International Journal of Cooperative Information Systems 01, no. 03n04 (December 1992): 579–617. http://dx.doi.org/10.1142/s0218215792000155.

Full text

Abstract:

In many application areas the information that may be of interest to a user is stored under the control of multiple, autonomous database systems. To support global transactions in a multidatabase environment, we must coordinate the activities of multiple Database Management Systems that were designed for independent, stand-alone operation. The autonomy and heterogeneity of these systems present a major impediment to the direct adaptation of transaction management mechanisms developed for distributed databases. In this paper we introduce a transaction model designed for a multidatabase environment. A multidatabase transaction is defined by providing a set of (local) sub-transactions, together with their precedence and dataflow requirements. Additionally, the transaction designer may specify failure atomicity and execution atomicity requirements of the multidatabase transaction. These high-level specifications are then used by the scheduler of a multidatabase transaction to assure that its execution satisfies the constraints imposed by the semantics of the application. Uncontrolled interleaving of multidatabase transactions may lead to the violation of interdatabase integrity constraints. We discuss the issues involved in a concurrent execution of multidatabase transactions and propose a new concurrency control correctness criterion that is less restrictive than global serializability. We also show how the multidatabase SQL can be extended to allow the user to specify multidatabase transactions in a nonprocedural way.

APA, Harvard, Vancouver, ISO, and other styles

4

Jing, Changhong, Wenjie Liu, Jintao Gao, and Ouya Pei. "Research and implementation of HTAP for distributed database." Xibei Gongye Daxue Xuebao/Journal of Northwestern Polytechnical University 39, no. 2 (April 2021): 430–38. http://dx.doi.org/10.1051/jnwpu/20213920430.

Full text

Abstract:

Data processing can be roughly divided into two categories, online transaction processing OLTP(on-line transaction processing) and online analytical processing OLAP(on-line analytical processing). OLTP is the main application of traditional relational databases, and it is some basic daily transaction processing, such as bank pipeline transactions and so on. OLAP is the main application of the data warehouse system, it supports some more complex data analysis operations, focuses on decision support, and provides popular and intuitive analysis results. As the amount of data processed by enterprises continues to increase, distributed databases have gradually replaced stand-alone databases and become the mainstream of applications. However, the current business supported by distributed databases is mainly based on OLTP applications, lacking OLAP implementation. This paper proposes an implementation method of HTAP for distributed database CBase, which provides an implementation method of OLAP analysis for CBase, and can easily deal with data analysis of large amounts of data.

APA, Harvard, Vancouver, ISO, and other styles

5

Khanuja, Harmeet Kaur, and Dattatraya Adane. "Monitor and Detect Suspicious Transactions With Database Forensic Analysis." Journal of Database Management 29, no. 4 (October 2018): 28–50. http://dx.doi.org/10.4018/jdm.2018100102.

Full text

Abstract:

The extensive usage of web has given rise to financially motivated illegal covert online transactions. So the digital investigators have approached databases for investigating undetected illegal transactions. The authors here have designed and developed a methodology to find the illegal financial transactions through the database logs. The objective is to monitor database transactions for detecting and reporting risk level of suspicious transactions. Initially, the process extracts SQL transactions from logs of different database systems, then transforms and loads them separately in uniform XML format which gives the transaction records and its metadata. The transaction records are processed with well-defined rules to get outliers present as suspicious transactions. This gives the initial belief of the transactions to be suspicious. The belief value of transactions is further rationalised using Dempster-Shafer's theory. This verifies the uncertainty and risk level of the suspected transactions to assure occurrences of fraud transactions.

APA, Harvard, Vancouver, ISO, and other styles

6

YI, JUNKAI, GANG LU, and KEVIN LÜ. "MONITORING CUMULATED ANOMALY IN DATABASES." International Journal of Software Engineering and Knowledge Engineering 19, no. 03 (May 2009): 421–52. http://dx.doi.org/10.1142/s0218194009004210.

Full text

Abstract:

A new type of database anomaly called Cumulated Anomaly (CA) is dealt with in this paper. It occurs when submitting the time of authorized transactions or the changed data is cumulated out of some thresholds. A database-level detection method for Cumulated Anomaly is proposed based on statistics and fuzzy set theories. By measuring each database transaction with a real number between zero and one, this method quantitatively monitors how dangerous a transaction is. The real number is termed dubiety degree; therefore the method is named as Dubiety-Determining Method (DDM). After formally presenting the concepts of Cumulated Anomaly and DDM, the algorithm of DDM is given in detail. Software system architecture to support DDM was designed and implemented. Three experiments were performed on it for testing DDM. The first experiment showed the general results of DDM with a set of randomly generated audit records, while the second one simulated a practical case. DDM monitored dubiety degrees for each database transaction and detected expected Cumulated Anomaly in two experiments. The effect on database performance by DDM was tested in the last experiment. Experimental results show that DDM method is feasible and effective.

APA, Harvard, Vancouver, ISO, and other styles

7

Lewis, Philip M., Arthur Bernstein, and Michael Kifer. "Databases and transaction processing." ACM SIGMOD Record 31, no. 1 (March 2002): 74–75. http://dx.doi.org/10.1145/507338.507354.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Bozkaya, T. "Indexing transaction time databases." Information Sciences 112, no. 1-4 (December 1998): 85–123. http://dx.doi.org/10.1016/s0020-0255(98)10024-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Haraty, Ramzi Ahmed, Sanaa Kaddoura, and Ahmed Zekri. "Transaction Dependency Based Approach for Database Damage Assessment Using a Matrix." International Journal on Semantic Web and Information Systems 13, no. 2 (April 2017): 74–86. http://dx.doi.org/10.4018/ijswis.2017040105.

Full text

Abstract:

One of the critical concerns in the current era is information security. Companies are sharing vast online critical data, which exposes their databases to malicious attacks. When protection techniques fail to prevent an attack, recovery is needed. Database recovery is not a straightforward procedure, since the transactions are highly interconnected. Traditional recovery techniques do not consider the interconnection between transactions because this information is not saved anywhere in the log file. Thus, they rollback all the transactions starting from the detected malicious transaction to the end of the log file. Hence, both affected and benign transactions will be rolled back, which is a waste of time. This paper presents an algorithm that works efficiently to assess the damage caused in the database by malicious transaction and recovers it. The proposed algorithm keeps track of the transactions that read from one another and store this information in a single matrix. The experimental results prove that the algorithm is faster than any other existing algorithm in this domain.

APA, Harvard, Vancouver, ISO, and other styles

10

Setiadi, Teguh. "APPLICATION OF INFORMATION SYSTEMS FOR TRANSACTION REPORTS BADAN KESWADAYAAN MASYARAKAT SEJAHTERA CASE STUDY SUMBEREJO KENDAL VILLAGE." SAINTEKBU 11, no. 2 (September 3, 2019): 28. http://dx.doi.org/10.32764/saintekbu.v11i2.358.

Full text

Abstract:

Abstract BKM Sejahtera is a collective leadership institution from a community association in the village of Sumberejo which has the role of mobilizing the potential and resources of the community in an effort to overcome various development issues in the village / village area. BKM Sejahtera still has many obstacles in its operations including the process of making reports and transactions - transactions that occur are still done conventionally, namely the making of reports still using Microsoft Excel as a recording of existing transactions but it is less effective because it requires a relatively long time in presenting reports finance, especially savings and loans and as a storage method, are relatively inefficient because they do not use databases so that they require a large space and difficulties in finding data. The risk of errors in the transaction process and the making of a savings and loan report are relatively high because the data written in the transaction book is sometimes not the same as the data inputted in Microsoft Excel. To overcome the above problems, an Information System Application will be made to the Prosperous Community Self-Help Agency Using the Accrual Basis Method. This application will produce financial reports per period, loan transaction reports, installment transaction reports, savings and loan transaction reports and withdrawal transaction reports. This application is made using a programming language that is PHP for the application interface and MySQL for database processing software. With this application can facilitate transactions and also can facilitate in getting financial reports quickly and have a database as a safe storage medium.

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Transaction databases"

1

Aleksic, Mario. "Incremental computation methods in valid and transaction time databases." Thesis, Georgia Institute of Technology, 1996. http://hdl.handle.net/1853/8126.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Tuck, Terry W. "Temporally Correct Algorithms for Transaction Concurrency Control in Distributed Databases." Thesis, University of North Texas, 2001. https://digital.library.unt.edu/ark:/67531/metadc2743/.

Full text

Abstract:

Many activities are comprised of temporally dependent events that must be executed in a specific chronological order. Supportive software applications must preserve these temporal dependencies. Whenever the processing of this type of an application includes transactions submitted to a database that is shared with other such applications, the transaction concurrency control mechanisms within the database must also preserve the temporal dependencies. A basis for preserving temporal dependencies is established by using (within the applications and databases) real-time timestamps to identify and order events and transactions. The use of optimistic approaches to transaction concurrency control can be undesirable in such situations, as they allow incorrect results for database read operations. Although the incorrectness is detected prior to transaction committal and the corresponding transaction(s) restarted, the impact on the application or entity that submitted the transaction can be too costly. Three transaction concurrency control algorithms are proposed in this dissertation. These algorithms are based on timestamp ordering, and are designed to preserve temporal dependencies existing among data-dependent transactions. The algorithms produce execution schedules that are equivalent to temporally ordered serial schedules, where the temporal order is established by the transactions' start times. The algorithms provide this equivalence while supporting currency to the extent out-of-order commits and reads. With respect to the stated concern with optimistic approaches, two of the proposed algorithms are risk-free and return to read operations only committed data-item values. Risk with the third algorithm is greatly reduced by its conservative bias. All three algorithms avoid deadlock while providing risk-free or reduced-risk operation. The performance of the algorithms is determined analytically and with experimentation. Experiments are performed using functional database management system models that implement the proposed algorithms and the well-known Conservative Multiversion Timestamp Ordering algorithm.

APA, Harvard, Vancouver, ISO, and other styles

3

Sinha, Aman. "Memory management and transaction scheduling for large-scale databases /." Digital version accessible at:, 1999. http://wwwlib.umi.com/cr/utexas/main.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Aleksic, Mario. "Incremental computation methods in valid & transaction time databases." [S.l.] : Universität Stuttgart , Fakultät Informatik, 1996. http://www.bsz-bw.de/cgi-bin/xvms.cgi?SWB6783621.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Konana, Prabhudev Chennabasappa, and Prabhudev Chennabasappa Konana. "A transaction model for active and real-time databases." Diss., The University of Arizona, 1995. http://hdl.handle.net/10150/187289.

Full text

Abstract:

Many emerging database applications, such as, automated financial trading, network management and manufacturing process control involve accessing and manipulating large amounts of data under time constraints. This has led to the emergence of active and real-time database as a research area, wherein transactions trigger other transactions and have time deadlines. In this dissertation, three important issues are investigated: the correctness criteria for various classes of transactions; real-time transaction scheduling algorithms for overload situation; and, a concurrency control policy that is sensitive to time deadline and transaction triggering. The first part of the dissertation deals with the issue of consistency of sensor reported data. We formally define sensor data consistency and a new notion of visibility called quasi immediate visibility (QIV) for concurrent execution of write-only and read-only transactions. We propose a protocol for maintaining sensor data consistency that has lower response time and higher throughput. The protocol is validated through simulation. Real-time schedulers must perform well both under underloaded and overloaded situations. In this dissertation, we propose a variation of weighted priority scheduling algorithm called Deadline Access Parameter Ratio (DAPR), that actively considers the I/O requirements and the amount of unprocessed work for "canned" transaction assumption. We show through simulation that DAPR performs significantly better than existing scheduling algorithms under overloaded situations. The limitation of the proposed algorithm is that in underloaded situations DAPR is not an option. The last part of this dissertation proposes a concurrency control (CC), called OCCWB, which is an extension of conventional optimistic CC. OCCWB takes advantage of the "canned" transaction assumption and includes pre-analysis stage, wherein, transactions are selectively blocked from executing if there is a high probability of restarting. The algorithm defines favorable serialization orders considering transaction semantics and tries to achieve such orders through appropriate priority adjustment. OCCWB is shown to perform significantly better than other CC policies under reasonable pre-analysis overhead for underloaded situation, and consistently better in overloaded situations, even with high pre-analysis overhead, for a wide range of workload and resource parameters.

APA, Harvard, Vancouver, ISO, and other styles

6

Zhang, Connie. "Static Conflict Analysis of Transaction Programs." Thesis, University of Waterloo, 2000. http://hdl.handle.net/10012/1052.

Full text

Abstract:

Transaction programs are comprised of read and write operations issued against the database. In a shared database system, one transaction program conflicts with another if it reads or writes data that another transaction program has written. This thesis presents a semi-automatic technique for pairwise static conflict analysis of embedded transaction programs. The analysis predicts whether a given pair of programs will conflict when executed against the database. There are several potential applications of this technique, the most obvious being transaction concurrency control in systems where it is not necessary to support arbitrary, dynamic queries and updates. By analyzing transactions in such systems before the transactions are run, it is possible to reduce or eliminate the need for locking or other dynamic concurrency control schemes.

APA, Harvard, Vancouver, ISO, and other styles

7

Mena, Eduardo Illarramendi Arantza. "Ontology-based query processing for global information systems /." Boston [u.a.] : Kluwer Acad. Publ, 2001. http://www.loc.gov/catdir/enhancements/fy0813/2001029621-d.html.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Brodsky, Lloyd. "A knowledge-based preprocessor for approximate joins in improperly designed transaction databases." Thesis, Massachusetts Institute of Technology, 1991. http://hdl.handle.net/1721.1/13744.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Dixon, Eric Richard. "Developing distributed applications with distributed heterogenous databases." Thesis, Virginia Tech, 1993. http://hdl.handle.net/10919/42748.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Xie, Wanxia. "Supporting Distributed Transaction Processing Over Mobile and Heterogeneous Platforms." Diss., Georgia Institute of Technology, 2005. http://hdl.handle.net/1853/14073.

Full text

Abstract:

Recent advances in pervasive computing and peer-to-peer computing have opened up vast opportunities for developing collaborative applications. To benefit from these emerging technologies, there is a need for investigating techniques and tools that will allow development and deployment of these applications on mobile and heterogeneous platforms. To meet these challenging tasks, we need to address the typical characteristics of mobile peer-to-peer systems such as frequent disconnections, frequent network partitions, and peer heterogeneity. This research focuses on developing the necessary models, techniques and algorithms that will enable us to build and deploy collaborative applications in the Internet enabled, mobile peer-to-peer environments. This dissertation proposes a multi-state transaction model and develops a quality aware transaction processing framework to incorporate quality of service with transaction processing. It proposes adaptive ACID properties and develops a quality specification language to associate a quality level with transactions. In addition, this research develops a probabilistic concurrency control mechanism and a group based transaction commit protocol for mobile peer-to-peer systems that greatly reduces blockings in transactions and improves the transaction commit ratio. To the best of our knowledge, this is the first attempt to systematically support disconnection-tolerant and partition-tolerant transaction processing. This dissertation also develops a scalable directory service called PeerDS to support the above framework. It addresses the scalability and dynamism of the directory service from two aspects: peer-to-peer and push-pull hybrid interfaces. It also addresses peer heterogeneity and develops a new technique for load balancing in the peer-to-peer system. This technique comprises an improved routing algorithm for virtualized P2P overlay networks and a generalized Top-K server selection algorithm for load balancing, which could be optimized based on multiple factors such as proximity and cost. The proposed push-pull hybrid interfaces greatly reduce the overhead of directory servers caused by frequent queries from directory clients. In order to further improve the scalability of the push interface, this dissertation also studies and evaluates different filter indexing schemes through which the interests of each update could be calculated very efficiently. This dissertation was developed in conjunction with the middleware called System on Mobile Devices (SyD).

APA, Harvard, Vancouver, ISO, and other styles

More sources

Books on the topic "Transaction databases"

1

N, Chorafas Dimitris. Transaction management: Managing complex transactions and sharing distributed databases. New York, N.Y: St. Martin's Press, 1998.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

McManus, Thomas E. Telephone transaction-generated information: Rights and restrictions. Cambridge, Mass. (200 Aiken, Cambridge 02138): Program on Information Resources Policy, Harvard University, Center for Information Policy Research, 1990.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Sowade, Olajide B. Transaction Management in Object Oriented Distributed Databases. London: University ofEast London, 1995.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

J, Bernstein Arthur, and Kifer M. 1954-, eds. Databases and transaction processing: An application-oriented approach. Boston, MA: Addison-Wesley, 2002.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Breitbart, Y. Overview of multidatabase transaction management. Stanford, Calif: Stanford University, Dept. of Computer Science, 1992.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Atluri, Vijay. Multilevel secure transaction processing. Boston: Kluwer Academic, 2000.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

Freitas, Alex A. Mining very large databases with parallel processing. Boston: Kluwer Academic Publishers, 1998.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

Primatesta, Fulvio. TUXEDO, an open approach to OLTP. London: Prentice Hall, 1995.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Prusinski, Ben. Expert Oracle GoldenGate. [New York]: Apress, 2011.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

Prusinski, Ben. Expert Oracle GoldenGate. [New York]: Apress, 2011.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Book chapters on the topic "Transaction databases"

1

Burger, Albert, and Peter Thanisch. "Branching Transactions: A transaction model for parallel database systems." In Directions in Databases, 121–36. Berlin, Heidelberg: Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/3-540-58235-5_39.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Lomet, David. "Supporting Transaction Time Databases." In Encyclopedia of Database Systems, 3857–62. New York, NY: Springer New York, 2018. http://dx.doi.org/10.1007/978-1-4614-8265-9_381.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Lomet, David. "Supporting Transaction Time Databases." In Encyclopedia of Database Systems, 2892–96. Boston, MA: Springer US, 2009. http://dx.doi.org/10.1007/978-0-387-39940-9_381.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Lomet, David. "Supporting Transaction Time Databases." In Encyclopedia of Database Systems, 1–6. New York, NY: Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4899-7993-3_381-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Pitoura, Evaggelia, Panos K. Chrysanthis, and George Samaras. "Distributed Databases and Transaction Processing." In Mobile Agents in Networking and Distributed Computing, 219–42. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2012. http://dx.doi.org/10.1002/9781118135617.ch9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Atluri, Vijay, Sushil Jajodia, and Binto George. "Transaction Processing in Multilevel Secure Databases." In Multilevel Secure Transaction Processing, 21–41. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/978-1-4615-4553-8_3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Kuno, Harumi, Goetz Graefe, and Hideaki Kimura. "Making Transaction Execution the Bottleneck." In Databases in Networked Information Systems, 71–85. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-37134-9_6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Atluri, Vijay, Sushil Jajodia, and Binto George. "Applications to Hierarchical and Replicated Databases." In Multilevel Secure Transaction Processing, 95–104. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/978-1-4615-4553-8_7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Gal, Avigdor. "On transaction management in temporal databases." In Temporal Databases: Research and Practice, 96–114. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0053699.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Mielikäinen, Taneli. "Privacy Problems with Anonymized Transaction Databases." In Discovery Science, 219–29. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30214-8_17.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Transaction databases"

1

Xu, Yabo, Ke Wang, Ada Wai-Chee Fu, and Philip S. Yu. "Anonymizing transaction databases for publication." In the 14th ACM SIGKDD international conference. New York, New York, USA: ACM Press, 2008. http://dx.doi.org/10.1145/1401890.1401982.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

M´te, J´n, and Jiri Safarik. "Transformation of Relational Databases to Transaction-Time Temporal Databases." In 2011 2nd Eastern European Regional Conference on the Engineering of Computer Based Systems (ECBS-EERC 2011). IEEE, 2011. http://dx.doi.org/10.1109/ecbs-eerc.2011.14.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Kafeza, Eleanna, Vasilis Delis, and Thanasis Hadzilacos. "Transaction synchronization in multiresolation spatial databases." In the fourth ACM workshop. New York, New York, USA: ACM Press, 1996. http://dx.doi.org/10.1145/258319.258349.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Ning, Chen, Chen An, Zhou Longxiang, and Liu Lu. "Clustering Data for Large Transaction Databases." In Proceedings of the 4th International Conference. WORLD SCIENTIFIC, 2000. http://dx.doi.org/10.1142/9789812792037_0020.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Liu, Chunyang, and Ling Chen. "Summarizing uncertain transaction databases by Probabilistic Tiles." In 2016 International Joint Conference on Neural Networks (IJCNN). IEEE, 2016. http://dx.doi.org/10.1109/ijcnn.2016.7727771.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Wieczerzycki, Waldemar. "Long-duration transaction support in design databases." In the fourth international conference. New York, New York, USA: ACM Press, 1995. http://dx.doi.org/10.1145/221270.221641.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Ouyang, Wei-Min, and Qin-Hua Huang. "Mining Negative Sequential Patterns in Transaction Databases." In 2007 International Conference on Machine Learning and Cybernetics. IEEE, 2007. http://dx.doi.org/10.1109/icmlc.2007.4370257.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

M.S.B, Phridviraj, Guru Rao C.V, Radhakrishna Vangipuram, and Aravind Cheruvu. "Similarity Association Pattern Mining in Transaction Databases." In DATA'21: International Conference on Data Science, E-learning and Information Systems 2021. New York, NY, USA: ACM, 2021. http://dx.doi.org/10.1145/3460620.3460752.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

T. Abdul-Mehdi, Ziyad, Ali Bin Mamat, Hamidah Ibrahim, and Mustafa Mat Deris. "A Transaction Consistency Management Model for Mobile Databases." In Annual International Conferences on Computer Games, Multimedia and Allied Technology. Global Science & Technology Forum (GSTF), 2008. http://dx.doi.org/10.5176/978-981-08-8227-3_cgat08-62.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Wong, Man Hon. "Recovery for transaction failures in object-based databases." In the fifteenth ACM SIGACT-SIGMOD-SIGART symposium. New York, New York, USA: ACM Press, 1996. http://dx.doi.org/10.1145/237661.237703.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Transaction databases"

1

Tolan, Gil D. Transaction Design Specification Medical Exam Databases System (MED) update Transaction. Fort Belvoir, VA: Defense Technical Information Center, December 1986. http://dx.doi.org/10.21236/ada271597.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Kang, Myong H., Oliver Costich, and Judith N. Froscher. A Practical Transaction Model and Untrusted Transaction Manager for a Multilevel-Secure Database System. Fort Belvoir, VA: Defense Technical Information Center, January 1992. http://dx.doi.org/10.21236/ada462360.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Costich, Oliver, and Sushil Jajodia. Maintaining Multilevel Transaction Atomicity in MLS Database Systems with Kernelized Architecture. Fort Belvoir, VA: Defense Technical Information Center, January 1993. http://dx.doi.org/10.21236/ada465420.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Costich, Oliver. Transaction Processing Using an Untrusted Scheduler in a Multilevel Database with Replicated Architecture. Fort Belvoir, VA: Defense Technical Information Center, January 1992. http://dx.doi.org/10.21236/ada462366.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Costich, Oliver, and John McDermott. A Multilevel Transaction Problem for Multilevel Secure Database Systems and its Solution for the Replicated Architecture. Fort Belvoir, VA: Defense Technical Information Center, January 1992. http://dx.doi.org/10.21236/ada462530.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!