Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("B ARBRE")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 60

  • Page / 3
Export

Selection :

  • and

THE UBIQUITOUS B-TREECOMER D.1979; COMPUTG SURV.; USA; DA. 1979; VOL. 11; NO 2; PP. 121-137; BIBL. 2 P.Article

ROBUST BALANCING IN B-TREESHUDDLESTON S; MEHLHORN K.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; VOL. 104; PP. 234-244; BIBL. 9 REF.Conference Paper

CMS - A CHUNK MANAGEMENT SYSTEMATKINSON MP; CHISHOLM KJ; COCKSHOTT WP et al.1983; SOFTWARE, PRACTICE AND EXPERIENCE; ISSN 0038-0644; GBR; DA. 1983; VOL. 13; NO 3; PP. 273-285; BIBL. 11 REF.Article

CHANGE AREA B-TREES: A TECHNIQUE TO AID ERROR RECOVERYMULLIN JK.1981; COMPUT. J.; ISSN 0010-4620; GBR; DA. 1981; VOL. 24; NO 4; PP. 367-373; BIBL. 9 REF.Article

ON B-TREES: ROUTING SCHEMES AND CONCURRENCYKWONG YS; WOOD D.sdINTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA/1980/SANTA MONICA CA; USA; NEW YORK: ASSOCIATION FOR COMPUTING MACHINERY; DA. S.D.; PP. 207-213; BIBL. 12 REF.Conference Paper

SPACE UTILIZATION AND ACCESS PATH LENGTH IN B-TREESQUITZOW KH; KLOPPROGGE MR.1980; INFORM. SYST.; GBR; DA. 1980; VOL. 5; NO 1; PP. 7-16; BIBL. 5 REF.Article

A NEW DATA STRUCTURE FOR REPRESENTING SORTED LISTSHUDDLESTON S; MEHLHORN K.1982; ACTA INFORMATICA; ISSN 0001-5903; DEU; DA. 1982; VOL. 17; NO 2; PP. 157-184; BIBL. 14 REF.Article

SOFTWARE-IMPLEMENTATION ASSOZIATIVER SPEICHER = IMPLANTATION DE MEMOIRES ASSOCIATIVES PAR LE LOGICIELGALL R; NAGL M.1981; ELEKTRON RECHENANL.; ISSN 0013-5720; DEU; DA. 1981; VOL. 23; NO 2; PP. 61-71; ABS. ENG; BIBL. 21 REF.Article

SEARCH WITHIN A PAGESTRONG HR; MARKOWSKY G; CHANDRA AK et al.1979; J. ASS. COMPUTG MACHIN.; USA; DA. 1979; VOL. 26; NO 3; PP. 457-482; BIBL. 10 REF.Article

IMPROVING STORAGE UTILIZATION IN BALANCED TREES (EXTENDED ABSTRACT)FREDERICKSON GN.sdANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING. 17/1979/MONTICELLO IL; USA; URBANA-CHAMPAIGN: UNIVERSITY OF ILLINOIS; DA. S.D.; PP. 255-264; BIBL. 7 REF.Conference Paper

HYSTERICAL B-TREESMAIER D; SALVETER SC.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 12; NO 4; PP. 199-202; BIBL. 9 REF.Article

KEY COMPARISON OPTIMAL 2-3 TREES WITH MAXIMUM UTILIZATIONBITNER JR; SHOU HSUAN HUANG.1981; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1981; VOL. 10; NO 3; PP. 558-570; BIBL. 5 REF.Article

CONCURRENT OPERATIONS IN LARGE ORDERED INDEXESKWONG YS; WOOD D.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; VOL. 83; PP. 207-222; BIBL. 12 REF.Conference Paper

APPROACHES TO CONCURRENCY IN B-TREESKWONG YS; WOOD D.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; VOL. 88; PP. 402-413; BIBL. 18 REF.Conference Paper

RANKING AND UNRANKING OF B-TREESGUPTA UI; LEE DT; WONG CK et al.1983; JOURNAL OF ALGORITHMS; ISSN 0196-6774; USA; DA. 1983; VOL. 4; NO 1; PP. 51-60; BIBL. 18 REF.Article

A NEW METHOD FOR CONCURRENCY IN B-TREESYAT SANG KWONG; WOOD D.1982; IEEE TRANS. SOFTW. ENG.; ISSN 0098-5589; USA; DA. 1982; VOL. 8; NO 3; PP. 211-222; BIBL. 25 REF.Article

WEIGHTED MULTIDIMENSIONAL B-TREES USED AS NEARLY OPTIMAL DYNAMIC DICTIONARIESKRIEGEL HP; VAISHNAVI VK.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 118; PP. 410-417; BIBL. 8 REF.Conference Paper

K-KLASSEN-BAEUME = ARBRES K-CLASSESLUTZ M.1981; ANGEW. INFORM.; ISSN 0013-5704; DEU; DA. 1981; VOL. 23; NO 1; PP. 17-20; ABS. ENG; BIBL. 2 REF.Article

The performance of current B-tree algorithms = La performance des algorithmes courants des B-arbresJOHNSON, T; SHASHA, D.ACM transactions on database systems. 1993, Vol 18, Num 1, pp 51-101, issn 0362-5915Article

POLYGON RETRIEVALWILLARD DE.1982; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1982; VOL. 11; NO 1; PP. 149-165; BIBL. 25 REF.Article

LA MICRO MEMOIRE RELATIONNELLE (MIMER): UN OUTIL POUR LA CONSTRUCTION DE SGBD RELATIONNELS; PROJET MICROBE = RELATIONAL MICROSTORAGE (MIMER): A TOOL FOR CONSTRUCTION OF RELATIONAL DBMS; MICROBE PROJECTFERNANDEZ FERNANDO.1981; ; FRA; DA. 1981; 172 P.; 21 CM; BIBL. 13 P.; TH. DOCT.-ING./GRENOBLE 1/1981Thesis

A COMPARISON OF ITERATIVE AND DEFINED CLASSES OF SEARCH TREESOTTMAN T; WOOD D.1982; INT. J. COMPUT. INF. SCI.; ISSN 0091-7036; USA; DA. 1982; VOL. 11; NO 3; PP. 155-178; BIBL. 10 REF.Article

DENSE MULTIWAY TREESCULIK K II; OTTMANN T; WOOD D et al.1981; ACM TRANS. DATABASE SYST.; ISSN 0362-5915; USA; DA. 1981; VOL. 6; NO 3; PP. 486-512; BIBL. 15 REF.Article

MICRO MUMPS: AN INTERACTIVE DATABASE LANGUAGE FOR MICRO-COMPUTERSWATANABE T; OHSAWA T; KUMA H et al.1981; SOFTW. PRACT. EXP.; ISSN 0038-0644; GBR; DA. 1981; VOL. 11; NO 12; PP. 1307-1314; BIBL. 5 REF.Article

A NEW DATA STRUCTURE FOR REPRESENTING SORTED LISTSMEHLHORN K.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 100; PP. 90-112; BIBL. 7 REF.Conference Paper

  • Page / 3