Sciweavers

111 search results - page 10 / 23
» An XML transaction processing benchmark
Sort
View
SOSP
2007
ACM
14 years 4 months ago
Tolerating byzantine faults in transaction processing systems using commit barrier scheduling
This paper describes the design, implementation, and evaluation of a replication scheme to handle Byzantine faults in transaction processing database systems. The scheme compares ...
Ben Vandiver, Hari Balakrishnan, Barbara Liskov, S...
AICCSA
2007
IEEE
110views Hardware» more  AICCSA 2007»
14 years 2 months ago
Benchmarking XML-Schema Matching Algorithms for Improving Automated Tuning
Several matching algorithms were recently developed in order to automate or semi-automate the process of correspondences discovery between XML schemas. These algorithms use a wide...
Mohamed Boukhebouze, Rami Rifaieh, Aïcha-Nabi...
TKDE
2002
67views more  TKDE 2002»
13 years 7 months ago
Recovery from Malicious Transactions
Preventive measures sometimes fail to deflect malicious attacks. In this paper, we adopt an information warfare perspective, which assumes success by the attacker in achieving part...
Paul Ammann, Sushil Jajodia, Peng Liu
ADC
2003
Springer
123views Database» more  ADC 2003»
14 years 1 months ago
Transactions in Loosely Coupled Distributed Systems
An exciting trend in enterprise computing lies in the integration of applications across an organisation and even between organisations. This allows the provision of services by a...
Alan Fekete, Paul Greenfield, Dean Kuo, Julian Jan...
SIGMOD
2007
ACM
162views Database» more  SIGMOD 2007»
14 years 8 months ago
Effective and efficient update of xml in RDBMS
Querying XML effectively and efficiently using declarative languages such as XQuery and XPath has been widely studied in both academic and industrial settings. Most RDBMS vendors ...
Zhen Hua Liu, Muralidhar Krishnaprasad, James W. W...