The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
One of the most important problems for peer-to-peer (P2P) system is searching and retrieving the correct information based on the query request. In this paper, we will discuss several existing resource discovery mechanisms that have been widely implemented in P2P networks. Thus, we are classifying the P2P systems based on their resource discovery mechanisms. Consequently, we will present taxonomy...
Reuse of proven process models increases modeling efficiency and ensure the quality of process models. To provide a better support for reuse, the retrieval mechanisms of process repositories should be able to propose similar process models that ranked according to their similarity degrees to the query request. As a process model and a query request on process structure can both be viewed as rooted,...
Search algorithms are a key issue to share resources in large distributed systems as peer networks. Several distributed interconnection structures and algorithms have already been studied in this context. With expanding ring algorithms, the efficiency of searches depends on the topology used to send query requests and the dynamics of the structure. In this paper, we present an interconnection structure...
Currently most distributed peer-to-peer network systems send to other peers when users' query request, but their search result is a great deal of needless answer as gap between their search goal and their information need. It is because each peers own different interest domain knowledge. However, we purpose interest-based peer selection in order to rank best peers under the user context with content...
This paper considers a multi-query optimization issue for distributed similarity query processing, which attempts to exploit the dependencies in the derivation of a query evaluation plan. To the best of our knowledge, this is the first work investigating a multi- query optimization technique for distributed similarity query processing (MDSQ). Four steps are incorporated in our MDSQ algorithm. First...
This paper proposes a novel data-grid-based k nearest neighbor query over large Chinese calligraphic character databases, which can significantly speed up the retrieval efficiency. Three steps are made. Firstly, when a user submits a query request to a query node, a process of character set reduction is performed using iDistance index in different data nodes, followed by sending the candidate characters...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.