• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 3,456
Next 10 →

Table 5: Types of transaction Variation. Transaction. Transaction.

in The BDIM Agent Toolkit Design
by Paolo Busetta, Kotagiri Ramamohanarao 1997
"... In PAGE 61: ...2.2 Types of Transaction There are 4 types of transactions, distinguishable by the attributes of their representative Transaction objects (see Table5 17 and Figures 39 and 40). The simplest is the local root transaction, which does not depend on any other transaction and whose controller is an object in the same process.... ..."
Cited by 9

Table Transaction

in A Practical Method for Realizing Semantics-Based Concurrency Control
by Roger Barga, Calton Pu, Wenwey Hseush

Table 2 Sensor Transactions and User Transactions

in Performance Evaluation on a Real-Time Database
by Suhee Kim , Sang H. Son, John A. Stankovic 2002
"... In PAGE 3: ... Some important attributes of a transaction include deadline DL, estimated execution time EET, CPU time required CPUtime, IO time required IOtime and arrival time A to the system. Table2 shows the settings for sensor transactions and user transactions. Table 2 Sensor Transactions and User Transactions ... ..."
Cited by 14

Table 2 Sensor Transactions and User Transactions

in Performance Evaluation on a Real-Time Database
by Suhee Kim, Sang H. Son, John A. Stankovic 2002
"... In PAGE 3: ... Some important attributes of a transaction include deadline DL, estimated execution time EET, CPU time required CPUtime, IO time required IOtime and arrival time A to the system. Table2 shows the settings for sensor transactions and user transactions. Table 2 Sensor Transactions and User Transactions ... ..."
Cited by 14

Table 1. HBZ transactions transaction percentage

in A Library Application on Top of an RDBMS: Performance Aspects
by O. Balownew, T. Bode, A.B. Cremers, J. Kalinski, J. E. Wolff, H. Rottmann
"... In PAGE 3: ... The protocol revealed that in the average there are ve new transactions every second with a peak of eleven. Table1 shows that a quar-... ..."

Table 2. HBZ transactions transaction percentage

in Maintaining Library Catalogues with an RDBMS: A Performance Study
by O. Balownew, T. Bode, A.B. Cremers, J. Kalinski, J. E. Wolff, H. Rottmann
"... In PAGE 5: ...Table2 shows that a quar- ter of all user transactions are document or corporate body retrievals. Nearly all of these retrievals consist of words occurring in the title resp.... ..."

Table 1. A transaction database with seven transactions.

in DOI 10.1007/s10115-003-0133-6 Springer-Verlag London Ltd. © 2004 Knowledge and Information Systems (2004) Mining Condensed Frequent-Pattern Bases ⋆
by Jian Pei, Guozhu Dong, Wei Zou, Jiawei Han
"... In PAGE 4: ...1 Example 1. Consider the transaction database shown in Table1 . Let the support threshold be min_sup = 1 and the error bound be k = 2.... In PAGE 7: ... Example 2. We construct a condensed FP-base Bd as follows for the transaction database TDB in Table1 , for a support threshold of 1 and an error bound of 2. Bd is shown in Fig.... ..."

Table 1. A transaction database with seven transactions.

in Abstract
by Jian Pei, Guozhu Dong
"... In PAGE 3: ... The method is illustrated next. Example 2 A condensed FP-base Bd for the transaction database TDB in Table1 , for the support threshold of 1 and the error bound of 2 is constructed as follows (as shown in Figure 1(b)), where the approximation function fBd is defined in Example 1. For each pattern X, let X:ub denote minfsup(X0)jX0 2 B, and X0 Xg, i.... ..."

Table 1. A transaction database with seven transactions.

in On Computing Condensed Frequent Pattern Bases
by Jian Pei, Guozhu Dong, Wei Zou, Jiawei Han
"... In PAGE 3: ... The method is illustrated next. Example 2 A condensed FP-base a67a87a101 for the transaction database a28a40a39a107a41 in Table1 , for the support threshold of a2 and the error bound of a95 is constructed as follows (as shown in Figure 1(b)), where the approximation function a68a92a69 a112 is defined in Example 1. For each pattern a11 , let a11a132a7 a44 a108 denote a127a54a128 a129 a0 a43a8a44a46a45a49a30a14a11a135a119a131a35 a51 a11a132a119a59a55 a67 , and a11a65a119a49a25a86a11 a1 , i.... ..."

Table 1: Transactional Throughput

in Lightweight recoverable virtual memory
by M. Satyanarayanan, Henry H. Mashburn, Puneet Kumar, David C. Steere, James J. Kistler 1994
Cited by 111
Next 10 →
Results 1 - 10 of 3,456
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University