DBLP
Leibniz Center for Informatics | |
URL | dblp |
---|---|
Commercial | No |
Registration | None |
Launched | 1993 |
DBLP is a
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
Developer(s) | Alexander Weber |
---|---|
Initial release | 2005 |
Stable release | 2.0b
/ September 6, 2006 |
Written in | Java |
Operating system | Unix |
Type | XML |
License | GPL |
Website | dbis.uni-trier.de/ (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
- 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
See also
- List of academic databases and search engines
- Association for Computational Linguistics
- CiteSeerX
- CogPrints
- Google Scholar
- Live Search Academic
- The Collection of Computer Science Bibliographies
- Dagstuhl
References
- ISSN 2150-8097. Retrieved March 13, 2018.
- ^ "Bibliographic database "dblp" celebrates silver anniversary". dagstuhl.de. Archived from the original on December 9, 2019. Retrieved December 9, 2019.
- ^ "Records in DBLP". Statistics. DBLP. Retrieved December 1, 2019.
- ^ "Computer science bibliography". DBLP. Retrieved March 13, 2018.
- ISBN 978-3-540-44158-8. Retrieved May 1, 2018.
- S2CID 143822.
- ^ "Michael Ley: ACM Distinguished Service Award". ACM (Association for Computing Machinery). Archived from the original on June 6, 2020.
- ^ 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) CS1 maint: numeric names: authors list (link) - S2CID 60831687. Retrieved November 4, 2020.
- ^ "What is the meaning of the acronym dblp?". FAQ. DBLP. Retrieved March 13, 2018.
External links
- DBLP author ID (P2456) (see uses)
- DBLP venue ID (P8926) (see uses)
- DBLP publication ID (P8978) (see uses)
- Official website
- 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". 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.