Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/286830 
Year of Publication: 
2021
Citation: 
[Journal:] International Journal on Digital Libraries [ISSN:] 1432-1300 [Volume:] 23 [Issue:] 2 [Publisher:] Springer [Place:] Berlin, Heidelberg [Year:] 2021 [Pages:] 113-132
Publisher: 
Springer, Berlin, Heidelberg
Abstract: 
Information access to bibliographic metadata needs to be uncomplicated, as users may not benefit from complex and potentially richer data that may be difficult to obtain. Sophisticated research questions including complex aggregations could be answered with complex SQL queries. However, this comes with the cost of high complexity, which requires for a high level of expertise even for trained programmers. A domain-specific query language could provide a straightforward solution to this problem. Although less generic, it can support users not familiar with query construction in the formulation of complex information needs. In this paper, we present and evaluate SchenQL, a simple and applicable query language that is accompanied by a prototypical GUI. SchenQL focuses on querying bibliographic metadata using the vocabulary of domain experts. The easy-to-learn domain-specific query language is suitable for domain experts as well as casual users while still providing the possibility to answer complex information demands. Query construction and information exploration are supported by a prototypical GUI. We present an evaluation of the complete system: different variants for executing SchenQL queries are benchmarked; interviews with domain-experts and a bipartite quantitative user study demonstrate SchenQL’s suitability and high level of users’ acceptance.
Subjects: 
Domain-specific query language
Bibliographic metadata
Digital libraries
Graphical user interface
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by Logo
Document Type: 
Article
Document Version: 
Published Version

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.