G. Özsoyoglu, N. H. Balkir, Graham Cormode, Z. M. Özsoyoglu
{"title":"Electronic books in digital libraries","authors":"G. Özsoyoglu, N. H. Balkir, Graham Cormode, Z. M. Özsoyoglu","doi":"10.1109/ADL.2000.848365","DOIUrl":"https://doi.org/10.1109/ADL.2000.848365","url":null,"abstract":"An electronic book is an application with a multimedia database of instructional resources, which include hyperlinked text, instructor's audio/video clips, slides, animation, still images, etc. As well as content-based information about these data, and metadata such as annotations, tags, and cross-referencing information. Electronic books in the Internet or on CDs today are not easy to learn from. We propose the use of a multimedia database of instructional resources in constructing and delivering multimedia lessons about topics in an electronic book. We introduce an electronic book data model containing (a) topic objects and (b) instructional resources, called instruction module objects, which are multimedia presentations possibly capturing real-life lectures of instructors. We use the notion of topic prerequisites for topics at different detail levels, to allow electronic book users to request/compose multimedia lessons about topics in the electronic book. We present automated construction of the \"best\" user-tailored lesson (as a multimedia presentation).","PeriodicalId":426762,"journal":{"name":"Proceedings IEEE Advances in Digital Libraries 2000","volume":"205 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132024538","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An integrated metamodel for knowledge representation in geolibraries","authors":"C. Baptista, Z. Kemp","doi":"10.1109/ADL.2000.848378","DOIUrl":"https://doi.org/10.1109/ADL.2000.848378","url":null,"abstract":"Geolibraries containing large volumes of complex spatiotemporal data occur in a variety of application domains. Considerable effort has gone into the design of metadata standards to enable exchange and sharing of georeferenced data sets. Strategies for federating information stores have to deal with integration at several levels, syntax, structure as well as semantics. This paper describes a generic metamodel for geolibraries. It encompasses a conceptually partitioned view of the data-space including metadata at various levels of a geolibrary. The model places particular emphasis on ontologies representing domain-dependent knowledge that exists within a research community, to facilitate resource discovery and retrieval of information from heterogeneous data stores.","PeriodicalId":426762,"journal":{"name":"Proceedings IEEE Advances in Digital Libraries 2000","volume":"348 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114008432","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Invading the fortress: how to besiege reinforced information bunkers","authors":"J. Hoppenbrouwers, H. Paijmans","doi":"10.1109/ADL.2000.848367","DOIUrl":"https://doi.org/10.1109/ADL.2000.848367","url":null,"abstract":"Information retrieval (IR) research has been very active over the last decades to develop approaches that allow machine indexing to significantly improve indexing practice in libraries. However due to practical limitations, this technology, is not often used in large-scale libraries. We propose a mix of existing technologies and new ideas to enable traditional libraries to adopt modern IR technology and to offer improved services to their customers, while leveraging their existing infrastructure and legacy databases.","PeriodicalId":426762,"journal":{"name":"Proceedings IEEE Advances in Digital Libraries 2000","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123236322","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Using regular tree automata as XML schemas","authors":"Boris Chidlovskii","doi":"10.1109/ADL.2000.848373","DOIUrl":"https://doi.org/10.1109/ADL.2000.848373","url":null,"abstract":"We address the problem of tight XML schemas and propose regular tree automata to model XML data. We show that the tree automata model is more powerful than the XML DTDs and is closed under main algebraic operations. We introduce the XML query algebra based on the tree automata model, and discuss the query optimization and query pruning techniques. Finally we show the conversion of tree automata schema into XML DTDs.","PeriodicalId":426762,"journal":{"name":"Proceedings IEEE Advances in Digital Libraries 2000","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122674244","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"BlueView: virtual document servers for digital libraries","authors":"A. Heuer, Holger Meyer, Beate Porst, P. Titzler","doi":"10.1109/ADL.2000.848387","DOIUrl":"https://doi.org/10.1109/ADL.2000.848387","url":null,"abstract":"In the BlueView project, digital library services are developed and partially implemented based on the architecture of virtual document servers. Using standard tools like full-text databases or information retrieval systems, object-relational database management systems, and replication and caching services, different heterogeneous local document servers have been integrated into one virtual server. Access to heterogeneous local systems can now be performed via a single query interface, integrating features of database query systems and information retrieval or search services. BlueView distributed query processing allows for combining structured queries against meta data with content-based (text retrieval) queries against full-text collections. Legacy systems such as existing preprint servers, search engines, or meta data (catalog) systems can also be integrated. Meta data and full-text documents can be replicated within this distributed architecture. In particular, in the view of members of a certain university, metadata and documents can be replicated to a local document server and integrated under different local user views. Aspects such as terms and conditions, licenses, diverse versions of documents, different formats, and data structures are considered as well. As application scenarios, preprint servers in Mathematics and the ACM SIGMOD Anthology as local document servers have been integrated into a virtual document server.","PeriodicalId":426762,"journal":{"name":"Proceedings IEEE Advances in Digital Libraries 2000","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132677752","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Yanyan Yang, O. Rana, Christos Georgousopoulos, D. Walker, Roy Williams
{"title":"Mobile agents and the SARA digital library","authors":"Yanyan Yang, O. Rana, Christos Georgousopoulos, D. Walker, Roy Williams","doi":"10.1109/ADL.2000.848371","DOIUrl":"https://doi.org/10.1109/ADL.2000.848371","url":null,"abstract":"Remote-sensing data about the Earth's environment is being created at an ever-increasing rate and distributed among heterogeneous remote sites. Traditional models of distributed computing are inadequate to support such complex applications, which generally involve a large quantity of data. We explore an approach based on mobile agent techniques for autonomous data processing and information discovery on the Synthetic Aperture Radar Atlas (SARA) digital library which consists of distributed multi-agency archives of multi-spectral remote-sensing imagery of the Earth. Our goal is to enable automatic and dynamic configuration of distributed parallel computing resources and to efficiently support on-demand processing of such a remote-sensing archive. The design, architecture and implementation of a prototype system that applies this approach is reported.","PeriodicalId":426762,"journal":{"name":"Proceedings IEEE Advances in Digital Libraries 2000","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131589942","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Building a digital library of newspaper clippings: the LAURIN project","authors":"Diego Calvanese, T. Catarci, G. Santucci","doi":"10.1109/ADL.2000.848366","DOIUrl":"https://doi.org/10.1109/ADL.2000.848366","url":null,"abstract":"The field of digital libraries has attracted a lot of research during the last years. However no project has specifically taken into account the problem of building a digital library of newspaper clippings. It is well known that a great deal of cultural knowledge is stored in the newspapers of yesterday. Since newspapers are not always easily accessible, special clipping archives were created in the 20th century. People interested in newspaper information benefit from these archives because the work of selecting, cutting and indexing articles is done by specialists. In order to maintain their important position in the information market, clipping archives should be able to integrate their special skills (such as professional knowledge and experience in gathering and treating newspaper information) into the new technologies of the information society. The EU-funded LAURIN project will carry out the preliminary work necessary for an efficient and smooth shift from the \"analogue\" clipping archive to its \"digital\" successor. In order to effectively, accomplish this hard task, the LAURIN Consortium has gathered a significant number of libraries, which are acting as final users and test sites and are continuously driving the system design and development with requirements, suggestions, testing, and criticisms. This paper presents the LAURIN design methodology, the main user and organizational requirements for a clipping digital library and the overall architecture of the LAURIN system.","PeriodicalId":426762,"journal":{"name":"Proceedings IEEE Advances in Digital Libraries 2000","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116423556","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On extending the XML engine with query-processing capabilities","authors":"K. Bohm","doi":"10.1109/ADL.2000.848376","DOIUrl":"https://doi.org/10.1109/ADL.2000.848376","url":null,"abstract":"We study how to efficiently evaluate queries over XML documents whose representation is according to the XML specification, i.e., XML files. The software architecture is as follows: the XML engine (i.e., XML parser) makes the structure of the documents explicit. The query processor operates directly on the output of the XML engine. We see two basic alternatives of how such a query processor operates: event-based and tree-based. In the first case, the query processor immediately checks for each event, e.g., begin of an element, if it contributes to a query result or if it invalidates current partial results. In the second case, the query processor generates an explicit transient representation of the document structure and evaluates the query set-at-a-time. This work evaluates these approaches and some optimizations in quantitative terms. Our main results are as follows. The event-based evaluation scheme is approximately 10% faster, even with all the optimizations from this article. The overhead of the query processors is small, compared to the running times of the XML engine. Finally exploiting DTD information in this particular context does not lead to a better performance.","PeriodicalId":426762,"journal":{"name":"Proceedings IEEE Advances in Digital Libraries 2000","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122158470","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
C. Böhm, Bernhard Braunmüller, H. Kriegel, Matthias Schubert
{"title":"Efficient similarity search in digital libraries","authors":"C. Böhm, Bernhard Braunmüller, H. Kriegel, Matthias Schubert","doi":"10.1109/ADL.2000.848382","DOIUrl":"https://doi.org/10.1109/ADL.2000.848382","url":null,"abstract":"Digital libraries are a core information technology. When the stored data is complex, e.g. high-resolution images or molecular protein structures, simple query types such as exact match query are hardly applicable. In such environments similarity queries, particularly range queries and k-nearest neighbor queries, are important query types. Numerous approaches have been proposed for the processing of similarity queries which mainly concentrate on highly dynamic data sets where insertion, update, and deletion operations occur. However, only little effort has been devoted to the case of rather static data sets-frequently, occurring in digital libraries. In this paper we introduce a novel technique for efficient similarity search on top of static or rarely changing data sets. In particularly we propose a special sorting order on the data objects which can be effectively exploited to substantially reduce the total query time of similarity queries. An extensive experimental evaluation with real-world data sets emphasizes the practical impact of our technique.","PeriodicalId":426762,"journal":{"name":"Proceedings IEEE Advances in Digital Libraries 2000","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115111072","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A view system for CORBA-wrapped data sources","authors":"Anastassia Spiridou","doi":"10.1109/ADL.2000.848396","DOIUrl":"https://doi.org/10.1109/ADL.2000.848396","url":null,"abstract":"Integration of data from disparate, heterogeneous and autonomous data sources is a common problem of different domains, including molecular biology. Mediator-based architectures and views have been used to integrate data and restructure data representation. CORBA facilitates data integration by providing language, platform and network transparency. In CORBA, data itself can be modelled in IDL, essentially creating IDL schemas. Integration of IDL modelled data from available source CORBA servers involves mapping between source IDL schemas and a preferred target IDL schema. Implementing the mapping manually is tedious. We have developed a system for creation of customised representations of data and data integration on CORBA-wrapped data sources. Views are employed to restructure data representation. The system supports semi-automatic generation of target CORBA servers based on the specification of source to target IDL mapping in a high-level mapping language.","PeriodicalId":426762,"journal":{"name":"Proceedings IEEE Advances in Digital Libraries 2000","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128117863","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}