Given the large number of databases on the Internet, it is increasingly difficult for users to identify the databases relevant to their queries. Instead of broadcasting a given query to all databases, one would like to intelligently select only a small subset of databases for evaluating the query in order to reduce the amount of network and I/O overheads. This problem, also known as query routing, can be divided into three sub-problems known as database selection, query evaluation, and result merging. In this paper, we address the database selection problem for routing bibliographic queries. By clustering bibliographic records and summarizing their statistics, we are able to construct a knowledge base for each database and use it for databa...
Literature search is one of the most important steps of the academic research. With more than one hu...
Peer-to-peer systems have recently a remarkable success in the social, academic, and commercial comm...
Traditionally, relational database systems have been designed for precise queries over structured da...
Query routing refers to the general problem of selecting from a large set of accessible information ...
this paper, we focus on the database selection problem in the context of a global digital library co...
Query routing refers to the general resource discovery problem of selecting from a large set of acc...
The proliferation of information sources available on the Wide World Web has resulted in a need for ...
Several graph databases provide support to analyze a large amount of highly connected data, and it i...
The web is a no longer operation it is only provides a link for searching the web document based on ...
Modern digital libraries require user-friendly and yet responsive access to the rapidly growing, het...
This paper considers the processing of digital library queries, consisting of a text component and a...
The rise of unstructured, semi structured and structured data making the data exploration task more ...
Recently, research projects such as PADLR and SWAP have developed tools like Edutella or Bibster, wh...
Ranking is the central problem for information retrieval (IR), and employing machine learning techni...
License, which permits unrestricted use, distribution, and reproduction in any medium, provided the ...
Literature search is one of the most important steps of the academic research. With more than one hu...
Peer-to-peer systems have recently a remarkable success in the social, academic, and commercial comm...
Traditionally, relational database systems have been designed for precise queries over structured da...
Query routing refers to the general problem of selecting from a large set of accessible information ...
this paper, we focus on the database selection problem in the context of a global digital library co...
Query routing refers to the general resource discovery problem of selecting from a large set of acc...
The proliferation of information sources available on the Wide World Web has resulted in a need for ...
Several graph databases provide support to analyze a large amount of highly connected data, and it i...
The web is a no longer operation it is only provides a link for searching the web document based on ...
Modern digital libraries require user-friendly and yet responsive access to the rapidly growing, het...
This paper considers the processing of digital library queries, consisting of a text component and a...
The rise of unstructured, semi structured and structured data making the data exploration task more ...
Recently, research projects such as PADLR and SWAP have developed tools like Edutella or Bibster, wh...
Ranking is the central problem for information retrieval (IR), and employing machine learning techni...
License, which permits unrestricted use, distribution, and reproduction in any medium, provided the ...
Literature search is one of the most important steps of the academic research. With more than one hu...
Peer-to-peer systems have recently a remarkable success in the social, academic, and commercial comm...
Traditionally, relational database systems have been designed for precise queries over structured da...