A Partition Checkpoint Strategy Based on Data Segment Priority

A partition checkpoint strategy based on data segment priority is presented to meet the timing constraints of the data and the transaction in embedded real-time main memory database systems(ERTMMDBS) as well as to reduce the number of the transactions missing their deadlines and the recovery time.Th...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Wuhan University journal of natural sciences Jg. 17; H. 2; S. 109 - 113
Hauptverfasser: Liang, Ping, Liu, Yunsheng
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Heidelberg Wuhan University 01.04.2012
Schlagworte:
ISSN:1007-1202, 1993-4998
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract A partition checkpoint strategy based on data segment priority is presented to meet the timing constraints of the data and the transaction in embedded real-time main memory database systems(ERTMMDBS) as well as to reduce the number of the transactions missing their deadlines and the recovery time.The partition checkpoint strategy takes into account the characteristics of the data and the transactions associated with it;moreover,it partitions the database according to the data segment priority and sets the corresponding checkpoint frequency to each partition for independent checkpoint operation.The simulation results show that the partition checkpoint strategy decreases the ratio of trans-actions missing their deadlines.
AbstractList A partition checkpoint strategy based on data segment priority is presented to meet the timing constraints of the data and the transaction in embedded real-time main memory database systems(ERTMMDBS) as well as to reduce the number of the transactions missing their deadlines and the recovery time.The partition checkpoint strategy takes into account the characteristics of the data and the transactions associated with it;moreover,it partitions the database according to the data segment priority and sets the corresponding checkpoint frequency to each partition for independent checkpoint operation.The simulation results show that the partition checkpoint strategy decreases the ratio of trans-actions missing their deadlines.
A partition checkpoint strategy based on data segment priority is presented to meet the timing constraints of the data and the transaction in embedded real-time main memory database systems (ERTMMDBS) as well as to reduce the number of the transactions missing their deadlines and the recovery time. The partition checkpoint strategy takes into account the characteristics of the data and the transactions associated with it; moreover, it partitions the database according to the data segment priority and sets the corresponding checkpoint frequency to each partition for independent checkpoint operation. The simulation results show that the partition checkpoint strategy decreases the ratio of transactions missing their deadlines.
Author LIANG Ping LIU Yunsheng
AuthorAffiliation School of Computer Science and Technology, HuazhongUniversity of Science and Technology, Wuhan 430074, Hubei,China
Author_xml – sequence: 1
  givenname: Ping
  surname: Liang
  fullname: Liang, Ping
  email: lpnjh@sohu.com
  organization: School of Computer Science and Technology, Huazhong University of Science and Technology
– sequence: 2
  givenname: Yunsheng
  surname: Liu
  fullname: Liu, Yunsheng
  organization: School of Computer Science and Technology, Huazhong University of Science and Technology
BookMark eNp9kE1LAzEQhoNUsFZ_gLf15iU6k-xHchFq_YSCheo5pLvZ7dZ20ybpof_elC0eZQ4zMM87L_NekkFnO0PIDcI9AhQPHlFkkgIyCgI5FWdkiFJymkopBnGOEEUG7IJcer8C4DIrcEgex8lMu9CG1nbJZGnKn61tu5DMg9PBNIfkSXtTJXH5rINO5qbZmLieuda6NhyuyHmt195cn_qIfL--fE3e6fTz7WMyntKSYSqo0KIuiqpcCA2xcuQacl0xXOQpCM5qYdAwzDGr0kLkZcFFyVPQC2ZMnWbAR-Suv7t1drc3PqhN60uzXuvO2L1XCBw5sFwWEcUeLZ313plabV270e4QIXWMQfVZqZiVOmalRNSwXuMj2zXGqZXduy5-9K_o9mS0tF2zi7o_pxRBYg6M_wKs-Xdb
Cites_doi 10.1109/TC.1986.1676845
10.1145/38713.38730
ContentType Journal Article
Copyright Wuhan University and Springer-Verlag Berlin Heidelberg 2012
Copyright_xml – notice: Wuhan University and Springer-Verlag Berlin Heidelberg 2012
DBID 2RA
92L
CQIGP
~WA
AAYXX
CITATION
7SC
7SP
7SR
7TB
7U5
8BQ
8FD
FR3
JG9
JQ2
KR7
L7M
L~C
L~D
DOI 10.1007/s11859-012-0813-8
DatabaseName 维普期刊资源整合服务平台
中文科技期刊数据库-CALIS站点
维普中文期刊数据库
中文科技期刊数据库- 镜像站点
CrossRef
Computer and Information Systems Abstracts
Electronics & Communications Abstracts
Engineered Materials Abstracts
Mechanical & Transportation Engineering Abstracts
Solid State and Superconductivity Abstracts
METADEX
Technology Research Database
Engineering Research Database
Materials Research Database
ProQuest Computer Science Collection
Civil Engineering Abstracts
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Materials Research Database
Civil Engineering Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Mechanical & Transportation Engineering Abstracts
Electronics & Communications Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
METADEX
Computer and Information Systems Abstracts Professional
Engineered Materials Abstracts
Solid State and Superconductivity Abstracts
Engineering Research Database
Advanced Technologies Database with Aerospace
DatabaseTitleList
Materials Research Database

DeliveryMethod fulltext_linktorsrc
Discipline Biology
Computer Science
DocumentTitleAlternate A Partition Checkpoint Strategy Based on Data Segment Priority
EISSN 1993-4998
EndPage 113
ExternalDocumentID 10_1007_s11859_012_0813_8
41091602
GroupedDBID -4W
-5D
-5G
-BR
-EM
-SA
-S~
-Y2
-~C
.86
.VR
06D
0R~
0VY
123
188
1N0
2.D
29R
29~
2B.
2C-
2J2
2JY
2KG
2KM
2LR
2RA
2VQ
2~H
30V
4.4
408
40D
40E
5VR
5VS
6NX
8RM
8TC
8UJ
92D
92I
92L
93E
93N
95-
95.
95~
96X
AAAVM
AABHQ
AAFWJ
AAIAL
AAJKR
AANXM
AARHV
AARTL
AATVU
AAWCG
AAYIU
AAYQN
AAYTO
ABFTV
ABJOX
ABKCH
ABMNI
ABNWP
ABQBU
ABTEG
ABTHY
ABTMW
ABXPI
ACBXY
ACGFS
ACHXU
ACKNC
ACMLO
ACOKC
ACOMO
ACPRK
ACSNA
ADHHG
ADHIR
ADINQ
ADKPE
ADRFC
ADURQ
ADYPR
ADZKW
AEBTG
AEGAL
AEGNC
AEJHL
AEJRE
AEKMD
AEOHA
AEPYU
AETLH
AEXYK
AFGCZ
AFLOW
AFNRJ
AFRAH
AFUIB
AFWTZ
AFZKB
AGAYW
AGDGC
AGGDS
AGJBK
AGQMX
AGWIL
AGWZB
AGYKE
AHAVH
AHBYD
AHSBF
AHYZX
AIIXL
AITGF
AJBLW
AJRNO
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMYQR
ARMRJ
ASPBG
AVWKF
AXYYD
AZFZN
B-.
BA0
BAPOH
BBWZM
BDATZ
BGNMA
CAG
CAJEA
CAJUS
CCEZO
CCVFK
CHBEP
COF
CQIGP
CS3
CSCUP
CW9
DU5
EBS
EIOEI
EJD
ESBYG
FA0
FEDTE
FFXSO
FIGPU
FINBP
FNLPD
FRRFC
FSGXE
FWDCC
GGCAI
GGRSB
GJIRD
GQ6
GQ7
HF~
HG6
HMJXF
HRMNR
HVGLF
HZ~
IJ-
IXD
I~X
I~Z
J-C
JBSCW
KOV
M4Y
MA-
N2Q
NDZJH
NF0
NQJWS
NU0
O9-
O93
O9G
O9I
O9J
P19
P9R
PF0
PT5
Q--
Q-0
QOK
QOR
QOS
R89
R9I
RHV
RNI
ROL
RPX
RSV
RZK
S16
S1Z
S26
S27
S28
S3B
SAP
SBY
SCL
SCLPG
SDH
SHX
SISQX
SMT
SNE
SNX
SOJ
SPISZ
STPWE
SZN
T13
T16
TCJ
TGH
TSG
TUC
U1G
U2A
U5K
U9L
UG4
UGNYK
UZ4
UZXMN
VC2
VFIZW
W48
WK8
YLTOR
Z7R
Z7X
Z7Z
Z83
Z88
Z8M
Z8R
Z8T
Z8W
Z92
ZOVNA
~A9
~WA
AAXDM
AAYZH
ABQSL
AFBBN
H13
ZMTXR
AAYXX
ABFSG
ACSTC
ADHKG
AEZWR
AFHIU
AGQPQ
AHWEU
AIXLP
CITATION
7SC
7SP
7SR
7TB
7U5
8BQ
8FD
FR3
JG9
JQ2
KR7
L7M
L~C
L~D
ID FETCH-LOGICAL-c2148-8a8f77dcb8a0a0a613a06ad21b640832f8e1e21615d4786c738c340ab2eef4503
IEDL.DBID RSV
ISSN 1007-1202
IngestDate Thu Sep 04 20:05:04 EDT 2025
Sat Nov 29 03:57:23 EST 2025
Fri Feb 21 02:31:26 EST 2025
Wed Feb 14 10:47:23 EST 2024
IsPeerReviewed true
IsScholarly true
Issue 2
Keywords partition checkpoint
data segment priority
TP 311.13
embedded real-time main memory database systems
database recovery
Language English
License http://www.springer.com/tdm
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c2148-8a8f77dcb8a0a0a613a06ad21b640832f8e1e21615d4786c738c340ab2eef4503
Notes embedded real-time main memory database systems database recovery partition checkpoint data segment priority
42-1405/N
A partition checkpoint strategy based on data segment priority is presented to meet the timing constraints of the data and the transaction in embedded real-time main memory database systems(ERTMMDBS) as well as to reduce the number of the transactions missing their deadlines and the recovery time.The partition checkpoint strategy takes into account the characteristics of the data and the transactions associated with it;moreover,it partitions the database according to the data segment priority and sets the corresponding checkpoint frequency to each partition for independent checkpoint operation.The simulation results show that the partition checkpoint strategy decreases the ratio of trans-actions missing their deadlines.
ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
PQID 1031302697
PQPubID 23500
PageCount 5
ParticipantIDs proquest_miscellaneous_1031302697
crossref_primary_10_1007_s11859_012_0813_8
springer_journals_10_1007_s11859_012_0813_8
chongqing_primary_41091602
PublicationCentury 2000
PublicationDate 20120400
PublicationDateYYYYMMDD 2012-04-01
PublicationDate_xml – month: 4
  year: 2012
  text: 20120400
PublicationDecade 2010
PublicationPlace Heidelberg
PublicationPlace_xml – name: Heidelberg
PublicationTitle Wuhan University journal of natural sciences
PublicationTitleAbbrev Wuhan Univ. J. Nat. Sci
PublicationTitleAlternate Wuhan University Journal of Natural Sciences
PublicationYear 2012
Publisher Wuhan University
Publisher_xml – name: Wuhan University
References Hu, Liu, Peng (CR4) 1996; 24
Gruenwald, Huang (CR8) 1996
Qin, Cao, Wang (CR7) 2009
Lin, Dunham (CR6) 1996
Huang, Gruenwald (CR9) 1996
Hagmann (CR2) 1986; 35
Lehman, Carey (CR1) 1987
Liu, Fu (CR10) 2002; 38
Lee, Cho (CR5) 1997
Jagadish, Silberschatz, Sudarshan (CR3) 1993
H. V. Jagadish (813_CR3) 1993
X. P. Qin (813_CR7) 2009
G. Hu (813_CR4) 1996; 24
T. J. Lehman (813_CR1) 1987
L. Gruenwald (813_CR8) 1996
D. Lee (813_CR5) 1997
Y. S. Liu (813_CR10) 2002; 38
J. L. Lin (813_CR6) 1996
R. B. Hagmann (813_CR2) 1986; 35
J. Huang (813_CR9) 1996
References_xml – start-page: 663
  year: 1997
  end-page: 668
  ident: CR5
  article-title: Checkpointing schemes for fast restart in main memory database systems[C]
  publication-title: Proceedings of the IEEE Pacific Rim Conference on Communications, Computers and Signal Processing
– volume: 38
  start-page: 170
  issue: 9
  year: 2002
  end-page: 172
  ident: CR10
  article-title: Main memory database organization and recovery techniques in active real-time database systems[J]
  publication-title: Computer Engineering and Applications
– start-page: 103
  year: 2009
  ident: CR7
  article-title: Simulation of main memory database parallel recovery[C]
  publication-title: Proceedings of Spring Simulation Multiconference
– volume: 24
  start-page: 35
  issue: 3
  year: 1996
  end-page: 38
  ident: CR4
  article-title: The recovery technique in main memory database system[J]
  publication-title: Journal of Huazhong University of Science and Technology
– start-page: 158
  year: 1996
  end-page: 165
  ident: CR6
  article-title: Segmented fuzzy checkpointing for main memory databases[C]
  publication-title: Proceedings of the ACM Symposium on Applied Computing
– start-page: 104
  year: 1987
  end-page: 117
  ident: CR1
  article-title: A recovery algorithm for a high performance memory-resident database system [C]
  publication-title: 1987
– start-page: 130
  year: 1996
  end-page: 137
  ident: CR9
  article-title: An update-frequency-valid-interval partition checkpoint technique for real-time main memory databases[C]
  publication-title: Proceedings of the 1st International Workshop on Real-Time Databases: Issues and Applications
– volume: 35
  start-page: 839
  issue: 9
  year: 1986
  end-page: 843
  ident: CR2
  article-title: A crash recovery scheme for a memory-resident database system[J]
  publication-title: IEEE Transactions on Computers
  doi: 10.1109/TC.1986.1676845
– start-page: 391
  year: 1993
  end-page: 404
  ident: CR3
  article-title: Recovering from main-memory Lapses[C]
  publication-title: 19
– start-page: 145
  year: 1996
  end-page: 149
  ident: CR8
  article-title: Crash recovery for real-time main memory database systems[C]
  publication-title: 1996
– volume: 35
  start-page: 839
  issue: 9
  year: 1986
  ident: 813_CR2
  publication-title: IEEE Transactions on Computers
  doi: 10.1109/TC.1986.1676845
– volume: 24
  start-page: 35
  issue: 3
  year: 1996
  ident: 813_CR4
  publication-title: Journal of Huazhong University of Science and Technology
– start-page: 663
  volume-title: Proceedings of the IEEE Pacific Rim Conference on Communications, Computers and Signal Processing
  year: 1997
  ident: 813_CR5
– start-page: 130
  volume-title: Proceedings of the 1st International Workshop on Real-Time Databases: Issues and Applications
  year: 1996
  ident: 813_CR9
– start-page: 103
  volume-title: Proceedings of Spring Simulation Multiconference
  year: 2009
  ident: 813_CR7
– start-page: 104
  volume-title: Proceedings of the 1987 ACM SIGMOD International Conference on Management of Data
  year: 1987
  ident: 813_CR1
  doi: 10.1145/38713.38730
– volume: 38
  start-page: 170
  issue: 9
  year: 2002
  ident: 813_CR10
  publication-title: Computer Engineering and Applications
– start-page: 158
  volume-title: Proceedings of the ACM Symposium on Applied Computing
  year: 1996
  ident: 813_CR6
– start-page: 391
  volume-title: Proceedings of the 19th International Conference on Very Large Data Bases
  year: 1993
  ident: 813_CR3
– start-page: 145
  volume-title: Proceedings of the 1996 ACM Symposium on Applied Computing
  year: 1996
  ident: 813_CR8
SSID ssj0039571
Score 1.8295324
Snippet A partition checkpoint strategy based on data segment priority is presented to meet the timing constraints of the data and the transaction in embedded...
SourceID proquest
crossref
springer
chongqing
SourceType Aggregation Database
Index Database
Publisher
StartPage 109
SubjectTerms Biomedical and Life Sciences
Computer Science
Life Sciences
Materials Science
Partitions
Priorities
Real time
Segments
Simulation
Strategy
Time measurements
Title A Partition Checkpoint Strategy Based on Data Segment Priority
URI http://lib.cqvip.com/qk/85480X/201202/41091602.html
https://link.springer.com/article/10.1007/s11859-012-0813-8
https://www.proquest.com/docview/1031302697
Volume 17
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAVX
  databaseName: Springer LINK
  customDbUrl:
  eissn: 1993-4998
  dateEnd: 20191231
  omitProxy: false
  ssIdentifier: ssj0039571
  issn: 1007-1202
  databaseCode: RSV
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22
  providerName: Springer Nature
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnR3LSsNAcNCq4MVqVUx9sIInJZBsXpuLUMTiqQg-6C0ku9sqQlKbVujfO5NkWxQ9KLmETLJZZmZ3njsDcJGFnosQx3alDCnM6NpCc7xTPMYnOhMqq5pNRIOBGA7j--Ycd2my3U1IstqpV4fdULRQbg-3UYx5tliHjYCKzZCJ_vBstl-KO1VWFvngXO5wE8r8aQgqqPBS5ON3_N1XwbTSNr8FSCu502__a8a7sNOomaxX88UerOm8A1t148lFB9qmmQNr1vY-XPfYhNiICMWQkvJtUrzmM1bW5WsXjOSdYgikpFJW6jH5FRnOqKD-dwfw1L99vLmzm-YKtuTkRBSpGEWRkplIHbxQqqdOmCruZqGPahkfCe1qTvqg8iMRysgT0vOdNONaj_zA8Q6hlRe5PgI2QhtG-0GWyTT0Vazw6ziWLldBrKMoVhZ0l1hOJnURjcSniqShwy24NGhfwlallAmBCSIwIQQmwoJzQ5gElwHFNtJcF_MyoW4VHtqTcWTBlaFG0qzH8vcRu396-xi2eUVOytw5gdZsOtensCk_Zq_l9Kziw09VQ9Yy
linkProvider Springer Nature
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3dS8MwED90KvridCpufkXwSSm0ademL8IQZeIcglN8C22SqQjtXDdh_713Xbuh6IPSl9Jr03CX5O5yl_sBnMS-6yDFthylfAozOpYwHO80D_GJiYWOc7CJoNsVT0_hXXGOOyuz3cuQZL5Szw-7oWqh3B5uoRpzLbEISx6h7JCLfv9YLr8Ud8q9LNqDc7jNy1DmT01QQYWXNHl-x999VUxza_NbgDTXO1fVf_V4A9YLM5O1puNiExZMUoOVKfDkpAbVEsyBFXN7C85bbEDDiATFUJLqbZC-JiOWTcvXThjpO82QSEmlLDPPtK_IsEcp4d9tw8PVZe-ibRXgCpbitIkoItEPAq1iEdl4oVaPbD_S3Il9D80y3hfGMZzsQe0FwleBK5Tr2VHMjel7TdvdgUqSJmYXWB99GOM141hFvqdDjV-HoXK4boYmCEJdh8aMy3IwLaIhPapI6tu8Dqcl22e0eSllYqBEBkpioBR1OC4FI3EaUGwjSkw6ziShVbjoT4ZBHc5KachiPma_t9j409tHsNru3XZk57p7swdrPBctZfHsQ2U0HJsDWFYfo9dseJiPyU9o_tkW
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8QwEB5848XVVXF9RvCklG3TbpteBFEXRVnEF95Cm6TrIrSrXQX_vTN9uCh6EOmldNokzCSdmcxkPoC92HcdpNiWo5RPYUbHEobjneYhPjGx0HEBNhH0euLhIbyqcE7zOtu9DkmWZxqoSlM6ag910h4ffEM1Q3k-3EKV5lpiEqY9dGQop-v65r7-FVMMqvC4aD_O4Tavw5o_NUHFFR6ztP-MXX9VUmPL81uwtNBB3ca_R78IC5X5yY7K-bIEEyZtwmwJSPnehEYN8sCqNb8Mh0dsSNOLBMhQwuppmA3SEcvLsrbvjPSgZkikZFOWmz7tNzIcXUa4eCtw1z29PT6zKtAFS3HaXBSRSIJAq1hENl6o7SPbjzR3Yt9Dc40nwjiGk52ovUD4KnCFcj07irkxidex3VWYSrPUrAFL0LcxXieOVeR7OtT4dRgqh-tOaIIg1C1Y_-S4HJbFNaRHlUp9m7dgvxbBJ21cYpkYKJGBkhgoRQt2ayFJXB4U84hSk73mklAsXPQzw6AFB7VkZLVO899bXP_T2zswd3XSlZfnvYsNmOeFZCm5ZxOmRi-vZgtm1NtokL9sF9PzAyRR4fo
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+Partition+Checkpoint+Strategy+Based+on+Data+Segment+Priority&rft.jtitle=%E6%AD%A6%E6%B1%89%E5%A4%A7%E5%AD%A6%E5%AD%A6%E6%8A%A5%EF%BC%9A%E8%87%AA%E7%84%B6%E7%A7%91%E5%AD%A6%E8%8B%B1%E6%96%87%E7%89%88&rft.au=LIANG+Ping+LIU+Yunsheng&rft.date=2012-04-01&rft.issn=1007-1202&rft.eissn=1993-4998&rft.volume=17&rft.issue=2&rft.spage=109&rft.epage=113&rft_id=info:doi/10.1007%2Fs11859-012-0813-8&rft.externalDocID=41091602
thumbnail_s http://cvtisr.summon.serialssolutions.com/2.0.0/image/custom?url=http%3A%2F%2Fimage.cqvip.com%2Fvip1000%2Fqk%2F85480X%2F85480X.jpg