In this paper, the goal is harvesting all documents matching a given (entity) query from a deep web source. The objective is to retrieve all information about for instance “Denzel Washington”, “Iran Nuclear Deal”, or “FC Barcelona” from data hidden behind web forms. Policies of web search engines usually do not allow accessing all of the matching query search results for a given query. They lim...

In this paper, the goal is harvesting all documents matching a given (entity) query from a deep web source. The objective is to retrieve all information about for instance “Denzel Washington”, “Iran Nuclear Deal”, or “FC Barcelona” from data hidden behind web forms. Policies of web search engines usually do not allow accessing all of the matching query search results for a given query. They lim...

Data warehouses are constructed to provide valuable and current information for decision-making. Typically this information is derived from the organization’s functional databases. The data warehouse is then providing a consolidated, convenient source of data for the decisionmaker. However, the available organizational information may not be sufficient to come to a decision. Information externa...

The external path length of a tree T is the sum of the lengths of the paths from the root to each external node. The maximal path length diierence, , is the diierence between the length of the longest and shortest such path. We prove tight lower and upper bounds on the external path length of binary trees with N external nodes and prescribed maximal path length diierence. In particular, we give...

Abstract—Keyword Search is known as a user-friendly alternative for structured languages to retrieve information from graph-structured data. Efficient retrieving of relevant answers to a keyword query and effective ranking of these answers according to their relevance are two main challenges in the keyword search over graph-structured data. In this paper, a novel scoring function is proposed, w...

Multiple sequence alignment (MSA) is a central problem in computational biology. It is well known that MSA can be formulated as a shortest path problem and solved using heuristic search, but the memory requirement of A* makes it impractical for all but the smallest problems. Partial Expansion A* (PEA*) reduces the memory requirement of A* by generating only the most promising successor nodes. H...

SHIL on the Web is the Website of the Israeli Citizens’ Advice Bureau. It provides information about rights, social benefits, government and public services and civil obligations. Activity on the site approaches 10,000 pages visited per day. It has interfaces in four languages: Hebrew, Arabic, Russian and English. Logfile analysis of the SHIL Website revealed to our surprise that about 60.7% of...

Web advertising is one of the major sources of income for numerous search engines, news sites and non-commercial publishers. Textual ads, characterized by Sponsored Search (SS) and Content Match (CM), make up a significant portion of Web advertising. In SS, with limited information about ad contents, given a query, the challenge is to place relevant ads alongside organic search results. Organic...

This preliminary study investigates how participants make sense of search results, web-pages and documents when they use web-based environments. From a sensemaking perspective, it bridges across previous information seeking studies, which focused on specific aspects of information interaction such as search or information relevance judgments. This study corroborates some of those previous obser...