• Home

  • Technology

  • Mapping Bibliographic Records with Bibliographic Hash Keys

If you can't read please download the document

Mapping Bibliographic Records with Bibliographic Hash Keys

  • Upload
    jakob-

  • View
    988

  • Download
    2

Embed Size (px)

Citation preview

Mapping Bibliographic Records with Bibliographic Hash Keys

Mapping Bibliographic Records with
Bibliographic Hash Keys

Jakob Vo
Verbundzentrale des GBV (VZG)

11. Internationales Symposium fr Informationswissenschaft (ISI 2009)

the problem

citation

record

data

document

same?

004A $00262025388011@ $a2003021A $aA @history of online information services, 1963 - 1976028A $dCharles P.$aBourne$9383311691028B/01 $dTrudi Bellardo$aHahn$9271366931033A $pCambridge, Mass. [u.a.]$nMIT Press034D $aXVI, 493 S

Bourne, C.P.; Hahn, T.B. (2003): A History of Online Information Services, 1963-1976. Cambridge, Mass.; London: MIT Press.

@book{Bourne2003, title={A History of Online Information Services, 1963-1976}, author={T.B. Hahn and C.P. Bourne}, year={2003},

Charles P. Bourne and Trudi Bellardo Hahn, A History of Online Information Services, 1963-1976 (Cambridge: MIT Press, 2003),

examples

solutions

persistent identifiers

duplicate detection

fingerprints

persistent identifiers

duplicate detection

multiple

comparisons

fingerprints (bibkey)

specification of bibkey

selection of fields

normalization

concatenating

prefix and hashing

004A $00262025388011@ $a2003021A $aA @history of online information services, 1963 - 1976028A $dCharles P.$aBourne$9383311691028B/01 $dTrudi Bellardo$aHahn$9271366931033A $pCambridge, Mass. [u.a.]$nMIT Press034D $aXVI, 493 S

Bourne, C.P.; Hahn, T.B. (2003): A History of Online Information Services, 1963-1976. Cambridge, Mass.; London: MIT Press.

@book{Bourne2003, title={A History of Online Information Services, 1963-1976}, author={T.B. Hahn and C.P. Bourne}, year={2003},

Charles P. Bourne and Trudi Bellardo Hahn, A History of Online Information Services, 1963-1976 (Cambridge: MIT Press, 2003),

selection of fields

authors/editorstitleyear

normalization

lowercase, letters, digits

Charles P. Bournec.bourneTrudi Bellardo Hahnt.hahn

unicode normalization form compatibility composition (NFKC)

composing the hash

bibkey level 114ed100f75dd4459cffeb272bdbc2d1e7

title

authors

year

sort andjoin by ,

prefix 1 and MD5 hash

bibkey level 0ahistoryofonlineinformationservices19631976 [t.hahn,c.bourne] 2003

usage in BibSonomy

aggregatedtag cloud

independentbibliographicrecords

bibkey

usage in web services

record

bibkey

response

service

challenges

determining

all authors

the full title

the year

problematic works

no authors

standard titles
(Introduction, News...)

unicode normalization

icons based on

www.gbv.de/wikis/cls/bibkey

Click to edit the title text format

Click to edit the outline text format

Second Outline Level

Third Outline Level

Fourth Outline Level

Fifth Outline Level

Sixth Outline Level

Seventh Outline Level

Eighth Outline Level

Ninth Outline Level

VZG

Bibliographic Hash Keys

Click to edit the title text format

VZG

Click to edit the outline text format

Second Outline Level

Third Outline Level

Fourth Outline Level

Fifth Outline Level

Sixth Outline Level

Seventh Outline Level

Eighth Outline Level

Ninth Outline Level


Generalized RC4 Key Collisions and Hash...where the hamming distance between two keys can only be one (j j= h= 1). In our generalized Transitional pattern, two keys can have various

Generalized RC4 Key Collisions and Hash...where the hamming distance between two keys can only be one (j j= h= 1). In our generalized Transitional pattern, two keys can have various

Documents
Hashing - WSU · Extendible Hashing Store hash table in a depth-1 tree Every search takes 2 disk accesses Insertions require few disk accesses Hash the keys to a long integer (“extendible”)

Hashing - WSU · Extendible Hashing Store hash table in a depth-1 tree Every search takes 2 disk accesses Insertions require few disk accesses Hash the keys to a long integer (“extendible”)

Documents
Evolution of P2P file sharing · Freenet uses semantic-free references to make the keys independent of the le content; this is achieved by using hash-based keys Keys are created using

Evolution of P2P file sharing · Freenet uses semantic-free references to make the keys independent of the le content; this is achieved by using hash-based keys Keys are created using

Documents
CH 9.2 : HASH TABLES · ISSUES WITH HASH TABLES ¡ Issues ¡ Collisions - some keys will map to the same index of H (otherwise we have a Direct Address Table). ¡ Chaining - put values

CH 9.2 : HASH TABLES · ISSUES WITH HASH TABLES ¡ Issues ¡ Collisions - some keys will map to the same index of H (otherwise we have a Direct Address Table). ¡ Chaining - put values

Documents
Hash Functions and Hash Tablestcs/ds/lecture6.pdf · Hash Functions and Hash Tables A hash function h maps keys of a given type to integers in a fixed interval [0;:::;N -1]. We call

Hash Functions and Hash Tablestcs/ds/lecture6.pdf · Hash Functions and Hash Tables A hash function h maps keys of a given type to integers in a fixed interval [0;:::;N -1]. We call

Documents
SPHINCS: practical stateless hash-based signatures · random generation of the OTS secret keys), and small public keys. However, key generation and signature time are exponential

SPHINCS: practical stateless hash-based signatures · random generation of the OTS secret keys), and small public keys. However, key generation and signature time are exponential

Documents
Still Passing the Hash 15 Years Later… - Black Hat … Passing the Hash 15 Years Later… Using the Keys to the Kingdom to Access All your Data Help Us Get Better! Please Fill Out

Still Passing the Hash 15 Years Later… - Black Hat … Passing the Hash 15 Years Later… Using the Keys to the Kingdom to Access All your Data Help Us Get Better! Please Fill Out

Documents
Hash Tables - Cornell University · Hash tables Main idea: give up on injectivity – Allow conversion from 'k to int to map multiple keys to the same integer – Conversion function

Hash Tables - Cornell University · Hash tables Main idea: give up on injectivity – Allow conversion from 'k to int to map multiple keys to the same integer – Conversion function

Documents
Bibliographic instruction

Bibliographic instruction

Art & Photos
Bibliographic relations

Bibliographic relations

Documents
Hashing. Concept of Hashing In CS, a hash table, or a hash map, is a data structure that associates keys (names) with values (attributes). Look-Up Table

Hashing. Concept of Hashing In CS, a hash table, or a hash map, is a data structure that associates keys (names) with values (attributes). Look-Up Table

Documents
Tehnologije za provjeru integriteta datoteka · Hash funkcije Svaka hash funkcija primjenjuje neki hash algoritam za ra čunanje sažetaka Obilježja hash funkcija: Hash funkcije

Tehnologije za provjeru integriteta datoteka · Hash funkcije Svaka hash funkcija primjenjuje neki hash algoritam za ra čunanje sažetaka Obilježja hash funkcija: Hash funkcije

Documents
On the Security of Hash Function Combinerstuprints.ulb.tu-darmstadt.de/2094/1/thesis.lehmann.pdf · 2011-04-18 · hash value. When a hash function deploys secret keys, it can also

On the Security of Hash Function Combinerstuprints.ulb.tu-darmstadt.de/2094/1/thesis.lehmann.pdf · 2011-04-18 · hash value. When a hash function deploys secret keys, it can also

Documents
ONLY )' /- BIBLIOGRAPHIC

ONLY )' /- BIBLIOGRAPHIC

Documents
CH 9.2 : HASH TABLES · 2016-02-07 · ISSUES WITH HASH TABLES Issues Collisions - some keys will map to the same index of H (otherwise we have a Direct Address Table). Chaining -

CH 9.2 : HASH TABLES · 2016-02-07 · ISSUES WITH HASH TABLES Issues Collisions - some keys will map to the same index of H (otherwise we have a Direct Address Table). Chaining -

Documents
CS350: Data Structures Hash Tables - GitHub Pagesycpcs.github.io/cs350-fall2014/lectures/Hash_Tables.pdf · CS350: Data Structures Hash Function • Hash function maps keys of a given

CS350: Data Structures Hash Tables - GitHub Pagesycpcs.github.io/cs350-fall2014/lectures/Hash_Tables.pdf · CS350: Data Structures Hash Function • Hash function maps keys of a given

Documents
3. Cryptography Reviewusers.umiacs.umd.edu/.../lectures/cs03_crypto.pdf · – Hash the same input twice → same hash value – Encrypt the same input with different keys → different

3. Cryptography Reviewusers.umiacs.umd.edu/.../lectures/cs03_crypto.pdf · – Hash the same input twice → same hash value – Encrypt the same input with different keys → different

Documents
Bibliographic Ontologies

Bibliographic Ontologies

Documents
Computer)Science)Fundamentals)107)) Why)Look)for)Be>er 2 ... · Computer)Science)Fundamentals)107)) Lecture)20)Contents) Hashing(–(Why?(Hash(Func0ons(–(folding,(mid7square(Hash(Func0ons(–(keys(which(are(strings

Computer)Science)Fundamentals)107)) Why)Look)for)Be>er 2 ... · Computer)Science)Fundamentals)107)) Lecture)20)Contents) Hashing(–(Why?(Hash(Func0ons(–(folding,(mid7square(Hash(Func0ons(–(keys(which(are(strings

Documents
Bibliographic coupling

Bibliographic coupling

Education
Hash Tables - Cornell University€¦ · Hash tables • If hash function not injective, multiple keys will collide at same array index • We're okay with that • Strategy: –

Hash Tables - Cornell University€¦ · Hash tables • If hash function not injective, multiple keys will collide at same array index • We're okay with that • Strategy: –

Documents
Hash Tables - ics.uci.edugoodrich/teach/cs260P/notes/HashTables.… · Hash Tables 5 Hash Functions and Hash Tables q A hash function h maps keys of a given type to integers in a

Hash Tables - ics.uci.edugoodrich/teach/cs260P/notes/HashTables.… · Hash Tables 5 Hash Functions and Hash Tables q A hash function h maps keys of a given type to integers in a

Documents
Creating bibliographic reference with Creating bibliographic

Creating bibliographic reference with Creating bibliographic

Documents
Maps and Hash Tables - York University · 2015-03-10 · Last Updated: 9 March 2015 EECS 2011 Prof. J. Elder - 16 - Hash Functions and Hash Tables ! A hash function h maps keys of

Maps and Hash Tables - York University · 2015-03-10 · Last Updated: 9 March 2015 EECS 2011 Prof. J. Elder - 16 - Hash Functions and Hash Tables ! A hash function h maps keys of

Documents
Still Passing the Hash 15 Years Later…media.blackhat.com/bh-us-12/Briefings/Duckwall/BH_US_12...Still Passing the Hash 15 Years Later… Using the Keys to the Kingdom to Access All

Still Passing the Hash 15 Years Later…media.blackhat.com/bh-us-12/Briefings/Duckwall/BH_US_12...Still Passing the Hash 15 Years Later… Using the Keys to the Kingdom to Access All

Documents
Hash Functions 1 Hash Functions Hash Functions 2 Cryptographic Hash Function Crypto hash function h(x) must provide o Compression output length is

Hash Functions 1 Hash Functions Hash Functions 2 Cryptographic Hash Function Crypto hash function h(x) must provide o Compression output length is

Documents
Arrangement of bibliographic sources Structure of bibliographic databases

Arrangement of bibliographic sources Structure of bibliographic databases

Documents
Review of basic cryptographically algorithm Asymmetric encoding (Private and Public Keys), Hash Function, Digital Signatures and Certification

Review of basic cryptographically algorithm Asymmetric encoding (Private and Public Keys), Hash Function, Digital Signatures and Certification

Documents
Bibliographic Management

Bibliographic Management

Technology
CIS 190: C/C++ Programmingcis.upenn.edu/~cis190/spring2014/lectures/12/lec12.pdf · •data structure that maps keys to values •a hash function takes a given key and ... Hash Map

CIS 190: C/C++ Programmingcis.upenn.edu/~cis190/spring2014/lectures/12/lec12.pdf · •data structure that maps keys to values •a hash function takes a given key and ... Hash Map

Documents