DBLP

DBLP is a computer science bibliography website. Starting in 1993 at Universität Trier in Germany, it grew from a small collection of HTML files[1] and became an organization hosting a database and logic programming bibliography site. Since November 2018, DBLP is a branch of Schloss Dagstuhl – Leibniz-Zentrum für Informatik (LZI).[2] DBLP listed more than 5.4 million journal articles, conference papers, and other publications on computer science in December 2020, up from about 14,000 in 1995 and 3.66 million in July 2016.[3] All important journals on computer science are tracked. Proceedings papers of many conferences are also tracked. It is mirrored at three sites across the Internet.[4][5][6]

dblp computer science bibliography
dblp's logo since 2012
Type of site
Online database
OwnerSchloss Dagstuhl – Leibniz-Zentrum für Informatik (LZI)
Created byMichael Ley
EditorLeibniz Center for Informatics
URLdblp.org
CommercialNo
RegistrationNone
Launched1993

For his work on maintaining DBLP, Michael Ley received an award from the Association for Computing Machinery (ACM) and the VLDB Endowment Special Recognition Award in 1997. Furthermore, he was awarded the ACM Distinguished Service Award for "creating, developing, and curating DBLP" in 2019.[7][8]

DBLP originally stood for DataBase systems and Logic Programming. As a backronym, it has been taken to stand for Digital Bibliography & Library Project;[9] however, it is now preferred that the acronym be simply a name, hence the new title "The DBLP Computer Science Bibliography".[10]

DBL-Browser
DBL-Browser
Developer(s)Alexander Weber
Initial release2005 (2005)
Stable release
2.0b / September 6, 2006 (2006-09-06)
Written inJava
Operating systemUnix
TypeXML
LicenseGPL
Websitedbis.uni-trier.de/DBL-Browser (offline)

DBL-Browser (Digital Bibliographic Library Browser) is a utility for browsing the DBLP website. The browser was written by Alexander Weber in 2005 at the University of Trier. It was designed for use off-line in reading the DBLP, which consisted of 696,000 bibliographic entries in 2005 (and in 2015 has more than 2.9 million).

DBL-Browser is GPL software, available for download from SourceForge. It uses the XML DTD. Written in Java programming language, this code shows the bibliographic entry in several types of screens, ranging from graphics to text:

  • Author page
  • Article page
  • Table of contents
  • Related conferences / journals
  • Related authors (graphic representation of relationships)
  • Trend analysis (graphics histogram)

DBLP is similar to the bibliographic portion of arxiv.org which also links to articles. DBL-Browser provides a means to view some of the associated computer science articles.

See also

References
  1. Ley, Michael (2009). DBLP: Some Lessons Learned (PDF). VLDB. Proceedings of the VLDB Endowment. Vol. 2, no. 2. pp. 1493–1500. CiteSeerX 10.1.1.151.3018. doi:10.14778/1687553.1687577. ISSN 2150-8097. Retrieved March 13, 2018.
  2. "Bibliographic database "dblp" celebrates silver anniversary". dagstuhl.de. Retrieved December 9, 2019.
  3. "Records in DBLP". Statistics. DBLP. Retrieved December 1, 2019.
  4. "Computer science bibliography". DBLP. Retrieved March 13, 2018.
  5. Ley, Michael (2002). "The DBLP Computer Science Bibliography: Evolution, Research Issues, Perspectives". String Processing and Information Retrieval. LNCS. Springer-Verlag. 2000: 481–486. doi:10.1007/3-540-45735-6_1. ISBN 978-3-540-44158-8. Retrieved May 1, 2018.
  6. Petricek, Vaclav; Cox, Ingemar J.; Han, Hui; Councill, Isaac G.; Giles, C. Lee (2005). "A Comparison of On-Line Computer Science Citation Databases". Research and Advanced Technology for Digital Libraries. LNCS. Springer-Verlag. 3652: 438–449. arXiv:cs/0703043. doi:10.1007/11551362_39. ISBN 978-3-540-28767-4. S2CID 143822.
  7. "Michael Ley: ACM Distinguished Service Award". ACM (Association for Computing Machinery). Archived from the original on June 6, 2020.
  8. Wadern, Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 66687. "Schloss Dagstuhl : Dr. Michael Ley to receive the ACM Distinguished Service Award". www.dagstuhl.de. Retrieved January 23, 2021.{{cite web}}: CS1 maint: multiple names: authors list (link)
  9. Ley, Michael; Reuther, Patrick (2006). "Maintaining an Online Bibliographical Database: The Problem of Data Quality" (PDF). Extraction et Gestion des Connaissances 2006. EGC 2006. Revue des Nouvelles Technologies de l'Information. Vol. RNTI-E-6. pp. 5–10. CiteSeerX 10.1.1.67.6180. ISBN 2-85428-718-5. S2CID 60831687. Retrieved November 4, 2020.
  10. "What is the meaning of the acronym dblp?". FAQ. DBLP. Retrieved March 13, 2018.
Wikidata has the properties:
  • Official website Edit this at Wikidata
    • CompleteSearch DBLP provides a fast search-as-you-type interface to DBLP, as well as faceted search. It is maintained by Hannah Bast and synchronized twice daily with the DBLP database. Since December 2007, the search functionality is embedded into each DBLP author page (via JavaScript).
  • "LZI+DBLP". Schloss Dagstuhl. Leibniz Center for Informatics. Retrieved February 11, 2017.
  • DBL-Browser at the Wayback Machine (archived 2011-02-22)
  • FacetedDBLP provides a faceted search interface to DBLP, synchronized once per week with the DBLP database. In addition to common facets such as year, author, or venues, it contains a topic-based facet summarizing and characterizing the current result set based on the author keywords for individual publications. For the DBLP data, FacetedDBLP also provides an RDF dump (using D2R server Archived February 26, 2012, at the Wayback Machine technology) as well as an SQL dump based on the underlying mysql database.
  • confsearch Conference search engine and calendar based on DBLP.
  • CloudMining DBLP is another faceted search solution with different visualizations.
  • Ariel Rosenfeld: "Is DBLP a Good Computer Science Journals Database?", Computer, IEEE, March 2023, pp.101-108, vol.56, DOI:10.1109/MC.2022.3181977.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.