tpcc_current (Дополнительные методические материалы), страница 4

Grou p s of row s from a table m ay be assigned to d ifferentfiles, d isks, or areas. If im p lem ented , the d etails of su ch p artitioning m u st be d isclosed .1.4.5Vertical p artitioning of tables is allow ed . Grou p s of attribu tes (colu m ns) of one table m ay be assignedto files, d isks, or areas d ifferent from those storing the other attribu tes of that table. If im p lem ented , the d etails ofsu ch p artitioning m u st be d isclosed (see Clau se 1.4.9 for lim itations).Comment: in the tw o clau ses above (1.4.4 and 1.4.5) assignm ent of d ata to d ifferent files, d isks, or areas not based onknow led ge of the logical stru ctu re of the d ata (e.g., know led ge of row or attribu te bou nd aries) is not consid eredp artitioning. For exam p le, d istribu tion or strip p ing over m u ltip le d isks of a p hysical file w hich stores one or m orelogical tables is not consid ered p artitioning as long as this d istribu tion is d one by the hard w are or the op eratingsystem w ithou t know led ge of the logical stru ctu re stored in the physical file.1.4.6Rep lication is allow ed for all tables.

All cop ies of tables w hich a re rep licated m u st m eet allrequ irem ents for atom icity, consistency, and isolation as d efined in Clau se 3. If im p lem ented , the d etails of su chrep lication m u st be d isclosed .Comment: Only one cop y of a rep licated table need s to m eet the d u rability requ irem ents d efined in Clau se 3.1.4.7Attribu tes m ay be ad d ed and / or d u p licated from one table to another as long as these changes d o notim p rove p erform ance.1.4.8Each attribu te, as d escribed in Clau se 1.3.1, m u st b e logically d iscrete and ind ep end ently accessible bythe d ata m anager.

For exam p le, W_STREET_1 and W_STREET_2 cannot be im p lem ented as tw o su b -p arts of ad iscrete attribu te W_STREET.1.4.9Each attribu te, as d escribed in Clau se 1.3.1, m u st be accessible by the d ata m anager as a singleattribu te. For exam p le, S_DATA cannot be im p lem ented as tw o d iscrete attribu tes S_DATA_1 and S_DATA_2TPC Benchm ark™C - Stand ard Sp ecification, Revision 5.11 - Page 18 of 1301.4.10The p rim ary key of each table m u st not d irectly rep resent the p hysical d isk ad d resses of the row orany offsets thereof. The ap p lication m ay not reference row s u sing relative ad d ressing since they are sim p ly offsetsfrom the beginning of the storage sp ace.

This d oes n ot p reclu d e hashing schem es or other file organizations w hichhave p rovisions for ad d ing, d eleting, and m od ifying record s in the ord inary cou rse of p rocessing. Excep tion: TheH istory table can u se relative ad d ressing bu t all other requ irem ents ap p ly.Comment 1: It is the intent of this clau se that the ap p lication p rogram (see Clau se 2.1.7) execu ting the transaction, orsu bm itting the transaction requ est, not u se p hysical id entifiers, bu t logical id entifiers for all accesses, and contain nou ser w ritten cod e w hich translates or aid s in the translation of a logical key to the location w ithin the table of theassociated row or row s.

For exam p le, it is not legitim ate for the ap p lication to bu ild a "translation t able" of logical-top hysical ad d resses and u se it to enhance p erform ance.Comment 2: Internal record or row id entifiers, for exam p le, Tu p le IDs or cu rsors, m ay be u sed u nd er the follow ingcond itions:1.For each transaction execu ted , initial access to any row m u st be via the key(s) sp ecified in the transactionp rofile and no other attribu tes. Initial access inclu d es insertion, d eletion, retrieval, and u p d ate of any row .2.Clau se 1.4.10 m ay not be violated .1.4.11While inserts and d eletes are not p erform ed on all tables, the system m u st not be configu red to takesp ecial ad vantage of this fact d u ring the test.

Althou gh inserts are inherently lim ited by the storage sp ace availableon the configu red system , there m u st be no restriction on inserting in any of the tables a m inim u m nu m ber of row sequ al to 5% of the table card inality and w ith a key valu e of at least d ou ble the range of key valu es p resent in thattable.Comment: It is requ ired that the sp ace for the ad d itional 5% table card inality be configu red for the test ru n andp riced (as static sp ace p er Clau se 4.2.3) accord ingly. For system s w here sp ace is configu red and d ynam icallyallocated at a later tim e, this sp ace m u st be consid ered as allocated and inclu d ed as static sp ace w hen p riced .1.4.12The m inim um d ecim al p recision for any com p u tation p erform ed as p art of the ap p lication p rogramm u st be the m axim u m d ecim al p recision of all the ind ivid u al item s in that calcu lation.1.4.13Any other ru les sp ecified elsew here in this d ocu m ent ap p ly to the im p lem entation (e.g., theconsistency ru les in Clau se 3.3).1.4.14The table attribu tes variable text, fixed text, d ate and tim e, and num eric m u st be im p lem ented u singnative d ata typ es of the d ata m anagem ent system (i.e., not the ap p lication p rogram ) w hose d ocu m ented p urp ose isto store d ata of the typ e d efined for the attribu te.

For exam p le, d ate and tim e m u st be im p lem ented w ith a natived ata typ e d esigned to store d ate and tim e inform ation.1.5Integrity Rules1.5.1In any com m itted state, the p rim ary key valu es m u st be u niqu e w ithin each table. For exam p le, in thecase of a horizontally p artitioned table, p rim ary key valu es of row s across all p artitions m u st be u niqu e.1.5.2In any com m itted state, no ill-form ed row s m ay exist in the d atabase. An ill-form ed row occu rs w henthe valu e of any attribu tes cannot be d eterm ined .

For exam p le, in the case of a vertically p artitioned table, a rowm u st exist in all the p artitions.TPC Benchm ark™C - Stand ard Sp ecification, Revision 5.11 - Page 19 of 1301.6D ata Access Transparency RequirementsData Access Transp arency is the p rop erty of the system w hich rem oves from the ap p lication p rogram anyknow led ge of the location and access m echanism s of p artitioned d ata. An im p lem entation w hich u ses verticaland / or horizontal p artitioning m u st m eet the requ irem ents for transp arent d ata access d escribed here.N o finite series of test can p rove that the system su p p orts com p lete d ata access transp arency. The requ irem entsbelow d escribe the m inim um cap abilities need ed to establish that the system p rovid es transp arent d ata access.Comment: The intent of this clau se is to requ ire that access to p hysically and / or logically p artitioned d ata bep rovid ed d irectly and transp arently by services im p lem ented by com m ercially available layers below the ap p licationp rogram su ch as the d ata/ file m anager (DBMS), the operating system , the hard w are, or any com bination of these.1.6.1Each of the nine tables d escribed in Clau se 1.3 m u st be id entifiable by n am es w hich have norelationship to the p artitioning of tables.

All d ata m anip u lation op erations in the ap p lication p rogram (see Clau se2.1.7) m u st u se only these nam es.1.6.2The system m u st p revent any d ata m anip u lation op eration p erform ed u sing the nam es d escribed inClau se 1.6.1 w hich w ou ld resu lt in a violation of the integrity ru les (see Clau se 1.5). For exam p le: the system m u stp revent a non -TPC-C ap p lication from com m itting the insertion of a row in a vertically p artitioned table u nless allp artitions of that row have been inserted .1.6.3Using the nam es w hich satisfy Clau se 1.6.1, any arbitrary non-TPC-C ap p lication m u st be able tom anip u late any set of row s or colu m ns:• Id entifiable by any arbitrary cond ition su p p orted by the u nd erlying DBMS• Using the nam es d escribed in Clau se 1.6.1 and u sing the sam e d ata m anip u lation sem antics and syntax for alltables.For exam p le, the sem antics and syntax u sed to u p d ate an arbit rary set of row s in any one table m u st also be u sablew hen u p d ating another arbitrary set of row s in any other table.Comment: The intent is that the TPC-C ap p lication p rogram u ses general p u rp ose m echanism s to m anip u late d atain the d atabase.TPC Benchm ark™C - Stand ard Sp ecification, Revision 5.11 - Page 20 of 130Clause 2: TRAN SACTION and TERMIN AL PROFILES2.1D efinition of Terms2.1.1The term select as u sed in this sp ecification refers to the action of id entifyin g (e.g., referencing,p ointing to) a row (or row s) in the d atabase w ithou t requ iring retrieval of the actu al content of the id entified row (s).2.1.2The term retrieve as u sed in this sp ecification refers to the action of accessing (i.e., fetching) the valu eof an attribu te from the d atabase and passing this valu e to the ap p lication p rogram .N ote: Field s that corresp on d to d atabase attribu tes are in UPPERCASE.