Designing keyword-based access paths is a common practice in digital libraries. They are easy to use and accepted by users and come with moderate costs for content providers. However, users usually have to break down the search into pieces if they search for stories of interest that are more complex than searching for a few keywords. After searching for every piece one by one, information must then be reassembled manually. In previous work we recommended narrative information access, i.e., users can precisely state their information needs as graph patterns called narratives. Then a system takes a narrative and searches for evidence for each of its parts. If the whole query, i.e., every part, can be bound against data, the narrative is considered plausible and, thus, the query is answered. But is it as easy as that? In this work we perform case studies to analyze the process of making a given narrative plausible. Therefore, we summarize conceptual problems and challenges to face. Moreover, we contribute a set of dimensions that must be considered when realizing narrative information access in digital libraries.
翻译:设计关键字访问路径是数字图书馆的常见做法。 用户很容易使用和接受这些关键字访问路径,而且其内容提供者的费用也比较低。 但是,如果用户搜索比搜索几个关键字更复杂的感兴趣故事,他们通常不得不将搜索分割成碎片。 在逐个查找每个文件之后,信息必须重新手工组合。 在先前的工作中,我们建议了叙述性信息访问,即用户可以精确地用图形模式来说明其信息需求,称为叙述。然后,一个系统对每个部分进行叙述和寻找证据。如果整个查询,即每个部分都能够与数据捆绑在一起,则说明性就被视为合理,因此回答问题。但是,这样简单吗? 在这项工作中,我们进行案例研究,分析给定述的合理性的过程。 因此,我们总结了概念上的问题和面临的挑战。 此外,我们在数字化图书馆实现叙述性信息访问时必须考虑的一组层面。