<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main">Designing A General Deep Web Harvester by Harvestability Factor</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author>
							<persName><forename type="first">Mohamamdreza</forename><surname>Khelghati</surname></persName>
							<email>s.m.khelghati@utwente.nl</email>
							<affiliation key="aff0">
								<orgName type="laboratory">Databases Group</orgName>
								<orgName type="institution">University of Twente</orgName>
								<address>
									<country key="NL">Netherlands</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Maurice</forename><surname>Van Keulen</surname></persName>
							<email>m.vankeulen@utwente.nl</email>
							<affiliation key="aff0">
								<orgName type="laboratory">Databases Group</orgName>
								<orgName type="institution">University of Twente</orgName>
								<address>
									<country key="NL">Netherlands</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Djoerd</forename><surname>Hiemstra</surname></persName>
							<email>d.hiemstra@utwente.nl</email>
							<affiliation key="aff0">
								<orgName type="laboratory">Databases Group</orgName>
								<orgName type="institution">University of Twente</orgName>
								<address>
									<country key="NL">Netherlands</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">Designing A General Deep Web Harvester by Harvestability Factor</title>
					</analytic>
					<monogr>
						<imprint>
							<date/>
						</imprint>
					</monogr>
					<idno type="MD5">7C8E2A5A21045C3A78B5E465CD9EAD2D</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2023-03-24T14:41+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<textClass>
				<keywords>
					<term>Deep Web</term>
					<term>Deep Web Harvester</term>
					<term>Harvester Performance Evaluation</term>
					<term>Harvestability Factor</term>
					<term>Harvester Design Framework</term>
				</keywords>
			</textClass>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>To make deep web data accessible, harvesters have a crucial role. Targeting dierent domains and websites enhances the need of a general-purpose harvester which can be applied to dierent settings and situations. To develop such a harvester, a large number of issues should be addressed. To have all inuential elements in one big picture, a new concept, called harvestability factor (HF ), is introduced in this paper.</p><p>The HF is dened as an attribute of a website (HF W) or a harvester (HF H) representing the extent to which the website can be harvested or the harvester can harvest. The comprising elements of these factors are dierent websites' or harvesters' features. These elements are gathered from literature or introduced through the authors' experiments. In addition to enabling designers of evaluating where they products stand from the harvesting perspective, the HF can act as a framework for designing harvesters. Designers can dene the list of features and prioritize their implementations. To validate the eectiveness of HF in practice, it is shown how the HFs elements can be applied in categorizing deep websites and how this is useful in designing a harvester. To validate the HF H as an evaluation metric, it is shown how it can be calculated for the harvester implemented by the authors. The results show that the developed harvester works pretty well for the targeted test set by a score of 14.783 of 15.</p></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1">Introduction</head><p>Nowadays, in an information-thirsty environment, the deep web concept receives lots of attention. The content hidden behind web forms which is invisible or hidden to general search engines like Google or Yahoo is dened as deep web <ref type="bibr" target="#b0">[1]</ref> ( also known as hidden or invisible web <ref type="bibr" target="#b1">[2]</ref>). Whether the goal of an access approach is indexing more representative content of a website (referred as Surfacing approach <ref type="bibr" target="#b2">[3]</ref>) or extracting the whole content, harvesters have a crucial role.</p><p>Covering dierent domains, and websites increases the need to have a generalpurpose harvester which can be applied to dierent settings and situations. To develop such a harvester, a number of issues like business domain, targeted websites, and the harvesting goals should be considered. Dierent business domains and goals could pose diverse characteristics on deep web access approaches. In some domains, a few number of big databases are the main sources of data and in others, data is scattered through a large number of websites. The latter makes it more desirable to have an approach with no need of extra conguration or at least minimal conguration eort for each website. The goal of the harvesting task is also important <ref type="bibr" target="#b0">[1]</ref>. If the goal is to extract all the data and the harvester downloads it partially, the harvesting task is not considered successful. However, this might be a success story if the goal is just to obtain a representative set of data <ref type="bibr" target="#b0">[1]</ref>. In addition to the domain and harvesting goal, features of deep websites could have great impacts on a deep web access approach. Dierent website features, from graphical interface to back-end designing and developing techniques could play an important role. If a website is Flash <ref type="bibr" target="#b3">[4]</ref>, an Applet, or a simple HTML page, it makes a big dierence on the access approach design. Without a well-dened list of elements aecting harvesting tasks, having a general deep web access approach seems far from reach.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Contributions As the main contribution, a new concept, called Harvestability</head><p>Factor (HF ) is introduced. This concept enables websites' and harvesters' designers of evaluating where they products stand in the harvesting point of view.</p><p>Through this concept, we also put all the important elements in harvesting deep websites in one big picture. This denes a framework for designing general deep web harvesters trying to cover all the features from dierent aspects in designing a harvester. Some of these factors are mentioned in the literature and the others are discovered through the experiments by the authors. Having all these important features in one big picture, we evaluate the inuence of each of them on harvesting. This helps creating an implementation strategy for harvester. Dening the importance of each feature helps prioritizing features implementations.</p><p>Sections In Section 2, the harvestability factor (HF ) is introduced. The Section 4 introduces the elements of HF W which are also applied for categorizing deep websites. In this section, all the features of deep websites aecting harvesting process are introduced and deep websites are categorized accordingly. In Section 5, the HF elements for a harvester are dened. All the requirements for designing a general purpose deep web harvester from general requirements to detailed ones are also discussed. The dierent approaches applied in literature to meet these requirements are also explored. Having mentioned all the necessary requirements, in Section 6, as a sample of such a general deep web harvester, the designed harvester by the authors of this paper is introduced and both HF as a design framework and an evaluation metric are validated. Finally, in Section 7, the conclusions drawn from this work are discussed and future work is suggested.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2">Harvestability Factor</head><p>To formalize all important issues in accessing deep web data, a new factor is introduced in this paper as Harvestability F actor (HF ). Although in a harvesting process, the roles of both harvester and website are intertwined, separate denitions are required by website and harvester designers for better understanding of harvesting processes. Hence, the HF is dened as an attribute of a website or a harvester representing the extent to which the website can be harvested (HF W ) or the harvester can harvest (HF H ).</p><p>As it is shown in Formula 2.1, the HF of a given harvester (h) is dened by applying function sum of multiplying harvester performances for each one of websites' features discussed in Section 4 (percentage of harvester failure shown by F a) by the importance of that feature. In this formula, Cr f and Co f represent the importance of a feature. n is the number of features and k represents the number of general features. The Cr f represents how critical is the feature for harvesting and the Co f represents how often this feature is used in the targeted domain. In this formula, general requirements are represented by GF j . This is discussed more in Section 5.</p><formula xml:id="formula_0">HF H (h) = n i=1 (1 − (hF a f i * Cr f i * Co f i )) + k j=1 (hGF j ) (2.1)</formula><p>In Formula 2.2, the HF W is dened for a website by considering its features discussed in Section 4. In this formula, given a website, for each one of its features, the average performance of harvesters and the importance of the feature are multiplied. n is the number of features and m is the number of harvesters considered which can be also one. In this formula, w p f i represents the absence or presence of the feature in the website.</p><formula xml:id="formula_1">HF W (w) = n i=1 (1 − (wp f i * (1/m m j=1 (F a f j )) * Cr f i )) (2.2)</formula><p>Assigning accurate values to the weights and features mentioned in these two formulas is beyond the scope of this paper and considered as a feature work. However, in Section (6), using simple approaches to assign values to these parameters, it is shown how these formulas can help in evaluating harvesters and websites. In this paper, it is tried to cover all aspects of the introduced HF elements; business domain, harvesting goal, harvester features and websites features to give a design harvester guideline.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3">Related Work</head><p>In this paper, two issues are targeted by introducing the HF ; HF as a harvester design framework and HF as an evaluation metric for websites and harvesters.</p><p>Since the introduction of deep web, there has been several attempts to give access to this part of web and improve the existing approaches <ref type="bibr" target="#b4">[5,</ref><ref type="bibr" target="#b5">6,</ref><ref type="bibr" target="#b6">7,</ref><ref type="bibr" target="#b7">8,</ref><ref type="bibr" target="#b8">9,</ref><ref type="bibr" target="#b9">10,</ref><ref type="bibr" target="#b2">3]</ref>. In all these approaches, the focus is on harvesters rather than the websites. They try to improve harvester performance by applying new techniques. Although this is essential but it is not enough. In this paper, it is believed that improving eciency, scalability, robustness, and other requirements of harvesters is not possible without having all the eecting factors in one big picture. Introducing the HF is the rst step in this direction. The HF helps to study not only the harvesters but also the targeted domain and the websites features in the design process.</p><p>Evaluate/Compare harvesters Small amount of work has been done in comparing and analyzing web harvesting tools. The related studies in literature such as the work in <ref type="bibr" target="#b10">[11,</ref><ref type="bibr" target="#b11">12]</ref> focus mainly on a limited number of aspects such as capability in dealing with dierent data formats, capability to record the extracted data, user friendliness, price in market, export formats, ability to manage the anonymous scraping and multi-threading. However, in this study, in addition to these features, a more detailed set of features are introduced. Despite other works, this paper provides a mechanism to produce an evaluation number to each harvester considering a wide range of features from general requirements to detailed capabilities.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4">Elements of Website Harvestability Factor</head><p>In this section, dierent features of websites which are related to harvesting processes are studied. The roles of each feature as dening element of a website HF are also mentioned. Each of these features could be also applied for categorizing deep websites from the harvesting perspective. In the extended version of this paper <ref type="bibr" target="#b12">[13]</ref>, the more detailed descriptions of these elements could be found.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.1">Web Development Techniques</head><p>A number of techniques applied in developing and designing web sites and web pages create challenges for harvesters. These techniques are usually applied to add interactivity to web pages as well as for improving site navigation. In following, there is a list of such techniques.</p><p>Embedded Scripting Languages in HTML Pages Embedded scripts in HTML pages can make content in layers either shown or hidden based on a user action, or change in a state. They can even build HTTP requests to ll out and submit a form dynamically. Managing HTML layers, performing redirections, dynamically generating navigations like pop-up menus and creating hidden anchors are some of the issues which could be caused by client-side scripts <ref type="bibr" target="#b3">[4,</ref><ref type="bibr" target="#b13">14]</ref>.</p><p>This prevents harvesters to have the page as it is shown to user.</p><p>Session Management Mechanisms In session management mechanism 1 , server keeps track of transactions made with a client. Based on this history and information on client resources, server could provide dierent services to the client. For harvesters, in later access to documents or distributed crawling, this will create problems <ref type="bibr" target="#b3">[4]</ref> as client environment changes or session expires.</p><p>Complex URL Redirections For reasons such as similar or moved domains, manipulating search engines or visitors, or URL shortening, URLs are redirected. This means dierent responses are given to browser request which results in browser showing a dierent page. These redirections could happen automatically or manually. It is easier for harvesters to deal with redirections handled on server side unless it is a redirection loop which does not load any page at the end or it is a redirect chain which might take longer time to have the nal page returned <ref type="bibr" target="#b3">[4]</ref>. Handling the redirections initiated by scripts embedded in page content is a completely dierent story. Refresh meta tag in HTML, JavaScript redirections, and Frame redirections are examples of these redirections.</p><p>Applets or Flash code If Flash or Applet is used for designing whole website, it is almost impossible for harvesters to access its content without running expensive analysis over each item. Nowadays, websites designers avoid these practices in order to make sure their sites are on good terms with crawlers. If only the welcoming page is designed by Flash or Applet, it becomes easier for harvesters.</p><p>If they are used for advertisements, they can be ignored.</p><p>Frames There are also some issues such as frames which can create diculties for harvesting processes. Detecting the right frame which contains the page content in a multi-frame page is one of the problems created by such issues. HTML Coding Practices For harvesters which rely on tags, attributes, and also presentation features, HTML code practices become highly important.</p><p>Having bad-written HTML code (like not closed tags) might cause problems in analyzing page HTML tree and therefore incapability of harvester to extract data. Lacking well-dened ID, class, and other explanatory attributes for items could also make diculties for harvesters and make them prone to mistakes.</p><p>Being consistent in coding practices for all pages and data items is also important. For example, if there is IDs for items, it should be the case for all of them or at least a dened set of items (like dierent categories). In some cases, data from the same category, even with the same presentation template have small dierences in the HTML code behind them. This might mislead harvesters.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.2">Website Policies Search Policies</head><p>Query Interfaces There are a number of dierent web interfaces classied as keyword-based, form-like, browsing, and a combination of them <ref type="bibr" target="#b14">[15]</ref>. Each one of these interfaces creates a dierent set of requirements for harvester. For example, in a form-like search interface, information on attribute-value bindings or accessing predened lists of values for attributes could be of great help for harvesters to decide on which queries to send to the search engine. Detecting interfaces and recognizing dierent features of web forms could be help harvesters.</p><p>Knowing that query interface provides dierent search options like searching by keyword, industry domain, region, or time helps harvester to act eciently.</p><p>Indexing Policies In case of having search feature in a website, it becomes important to know about the indexing policies. For example, with stop-words indexed in a web site, sending a stop-word query is one of the most reliable options to have a response. Also, if there is no limitation on browsing through search results, sending only one stop-word results in a high coverage. In addition to indexing policies regarding stop words, it is important to know which parts of data are indexed. For example, having only titles indexed makes great dierence in dening next queries with having whole text of detailed pages indexed. This is the case in generating queries based on most frequent words in visited pages.</p><p>Search Queries and Algorithms In response to a query posed to a search engine, websites do not necessarily follow the same principles. In some cases, stop-words are removed from search queries, query phrases are treated in dierent ways (considered as AND phrase or OR phrase), or number of returned results shown to user is limited. There might be even dierences on additional information provided in reply to a query, such as statistics on search results and number of found related answers. There are also websites which put a limitation on the number of queries a client can send.</p><p>Navigation In most of websites, a query is sent, search results are displayed and by following each one of those returned results, a detailed page is represented.</p><p>However, there are situations in which this is not the case. In some websites, in return to a query, a list of categories related to that query are displayed.</p><p>Following each one of those categories might end up in another subcategory. This makes it dicult for harvester to realize which returned page is a category or actually a detailed page.</p><p>Security, Privacy and Legal Policies Answering this question should be one of the rst steps in harvesting process: is it legal to access data, store it and present it to users?. It is also important to note that if login is required by website to access data. Considering website's terms of service to follow the privacy policies is also important. In some websites, the Robots Exclusion Protocol is applied which gives instructions about the site to web robots in a le named Robots.txt. In case of the existence of such a le and depending on how strict it is asked to be followed, necessary concerns should be considered. Not all the websites welcome bots (harvesters, or crawlers) with open arms. Having recognized bots through trac monitoring, bot identity declaration, or real person declaration techniques like a CAPTCHA, websites can use various measures to stop or slow them down. Blocking an IP address, disabling web service API, commercial anti-bot services, or using application rewalls are some of these measures. It is also important to note other privacy policies of the website like policy on disclosing aggregate information for analytical purposes by owners of website.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.3">Data and Content</head><p>Type and Format of Residing Data in Data Sources The content of a deep website could be categorized in two dierent groups <ref type="bibr" target="#b0">[1]</ref>: structured data found in almost all shopping websites (products as entities), movie sites, job listings, and etc, and unstructured data like articles and papers. Each of these mentioned data types have dierent features which could be helpful in harvesters performances. For example, in a website representing structured data, using the features of a data item like company name could help in dening next queries resulting in a more ecient crawl. It is also of a great importance for harvesters to know about dierent data le formats for pdf, image, or video les. Dierent data formats need dierent handlers to download them.</p><p>Data Layout How data is represented in web pages aects the harvesters relying on presentation features of data. Dierent data types in a website could be presented in dierent ways. Even data items of a same category could be presented dierently based on their features. If these dierences in presentation are not known to harvester, it will use the same algorithm to extract all data. This might result in extracting none or undesired information. Structural variations on data presentation must be also tolerated by harvesters and treated accordingly. If the data is represented in a structured way like lists or tables or it is represented in text or a combination of both, harvester should treat them differently. It is also important if a data item has elds represented as nested data on pages; for example, comments or scores information. This poses dierent requirements on extracting and storage of information.</p><p>Data Type Formats Including ontologies and text-patterns in the process of extracting data from detailed pages makes it important to investigate how they can aect the harvesting process. Committing to one ontology and following same patterns for same concepts like dd-mm-yyyy format for all dates mentioned on the website could aect the conguration and design of the harvester. Also, for example, if the mentioned address format on the website is not the same for all addresses mentioned in the website, it can have a great eect on the harvester conguration.</p><p>Information of a Data Item is Scattered in Dierent Pages Usually, the queries are sent to search engine, returned results are followed and data about desired items is extracted. However, this is not always the case. In some cases data of a interesting data item is scattered in website. In a more common way, general data is presented in the page navigated through search results.</p><p>However, more detailed information is provided in some other links which is accessible (only) through this detailed page (you need to go to the detailed page and then browse through the tabs or links to access the information you want).</p><p>Finding these links and extracting information from them could be a challenge for harvesters.</p><p>Providing Semantic Annotations (Meta data) The pages may include meta data or semantic markups and annotations. The annotations might be embedded in the pages or organized into a semantic layer <ref type="bibr" target="#b15">[16]</ref> stored and managed separately from the web pages. Data schema and instructions from this layer can be retrieved by harvesters before scraping the pages.</p><p>Website Content Language Dealing with the language of the targeted website is one of the abilities that the harvesters should have. Some of the approaches applied in harvesters are based on parsing the content of web pages like data patterns. Having this in mind, it should be noted that dealing with Chinese language needs dierent congurations than English or the Farsi languages. Having dierent languages in the targeted websites will cause diculties for these harvesters.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5">Elements of Harvester Harvestability Factor</head><p>As mentioned in the Introduction Section, designing a deep web access approach is highly aected by business domains, websites, and the harvesting goals. In the previous section, the features of a website aecting the HF is mentioned.</p><p>In dening the harvestability factor for a harvester, in addition to the ability of the harvester in dealing with each one of the mentioned website features in the previous section, there are also a number of general requirements which should be met by the harvester. These two set of features help us in dening the HF for a harvester. Knowing about the techniques and methods applied in each harvester helps in deciding about the harvester performs for each one of the elements. Therefore, in this section, a subsection is dedicated to dening these methods and techniques.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.1">High Level Requirements</head><p>Every general purpose harvester, despite the dierences among its goal, and the domain and websites it is targeting, should meet a set of requirements important in all harvesting processes. Being automatic or running with minimal conguration is one of these requirements. Being scalable (applicable to a large number of websites), independent (of business domain, technology, and etc), ecient (with the least possible number of queries, harvests the most possible amount of data), easy to use (conguration and run settings should be easy for users to perform), and resilient to changes both on website content and presentation are other general requirements which should be followed by a harvester. With these features, a harvester should be able to ll in forms eciently and automatically, extract data/entities from the returned results pages, and store the extracted data 2 <ref type="bibr" target="#b14">[15]</ref>. For all these steps considered in a deep web harvesting process, having an automatic error/change detection helps to improve harvesting process. This enables the harvester of doing an uninterrupted harvest as it becomes capable of detecting and resolving issues like IP based blocking, website failures, and etc. The harvester should be capable of providing rm guaranties about the exhaustive coverage of the harvested part of the Web. Size estimation of deep websites</p><p>[?] and also dening a stop condition for harvesting process could help in reaching this goal. In monitoring entities on the Web, it becomes highly important if the harvester could be able to keep the data up-to-date. This needs harvesters being capable of detecting new and deleted entities on the Web. While fullling these high level requirements, the harvester should be also capable of harvesting the dierent categories of websites mentioned in Section 4. There are dierent approaches to meet these requirements in literature. In the following section, these approaches are introduced.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.2">Harvesting Techniques</head><p>To access data behind web forms, a wide range of harvesters are suggested in literature <ref type="bibr" target="#b4">[5,</ref><ref type="bibr" target="#b5">6,</ref><ref type="bibr" target="#b6">7,</ref><ref type="bibr" target="#b7">8,</ref><ref type="bibr" target="#b8">9,</ref><ref type="bibr" target="#b9">10,</ref><ref type="bibr" target="#b2">3]</ref>. The dierences among these harvesters root from different sources; from applied techniques in each step of harvesting process to the main goal behind the harvester design. In this paper, the focus in categorizing harvesters is on the techniques and tools applied by harvesters to meet the requirements introduced in Subsection 5.1 and Section 4. This categorization helps reasoning why a harvester could work well for a website and not for the other.</p><p>It also helps to judge about harvester performance on a website with known features before even applying it in practice. If known that harvesters from a category have problems with website with a specic feature, with the features of the website and harvester at hand, it is possible to predict the outcome of harvesting process. In the following, this classication is represented <ref type="bibr" target="#b7">[8]</ref> 3 .</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.">HTML-based harvesters</head><p>In HTML-based harvesters, the harvester relies on a set of dierent features of document HTML code <ref type="bibr" target="#b16">[17]</ref>. To analyze the HTML structure of the pages, the document is translated into a parsing tree. This could be done by using browser controls like Internet Explorer to parse webpages into Data Object Model (DOM) trees. Then, by running a number of pre-dened extraction rules on the tree, the data is extracted.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.">Harvesters based on Natural Language Processing (NLP) techniques</head><p>In these harvesters <ref type="bibr" target="#b17">[18,</ref><ref type="bibr" target="#b18">19]</ref>, NLP techniques such as ltering, part-of-speech tagging, and lexical semantic tagging are applied to build relationships between phrases and sentences. From these extracted relationships, a number of extraction rules can be derived. These rules are based on syntactic and semantic constraints and help to identify the relevant information within a document.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.">Machine learning based harvesters</head><p>These harvesters <ref type="bibr" target="#b19">[20]</ref> rely on a given set of training examples to derive a number of extraction rules. In these techniques, rather than relying on linguistic constraints found in the page, rules are based on features of the structure of the pieces of data.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.">Modeling-based harvesters</head><p>In modeling-based harvesters <ref type="bibr" target="#b20">[21,</ref><ref type="bibr" target="#b21">22]</ref>, a data model is dened. In this data model, a number of objects, their properties and relationships are dened.</p><p>Based on this data model and its modeling primitives, points of interest are located in Web pages.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.">Ontology-based harvesters</head><p>In these harvesters <ref type="bibr" target="#b22">[23]</ref>, the extraction process is based on the data and not the presentation structure. These harvesters need a specic domain ontology. Through domain ontologies, concepts relevant to a particular topic or area of interest are dened and available for harvesters. The ontology-based harvesters use these ontologies to locate ontology's constants present in the page and to construct objects associated with them.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="6.">Computer vision based harvester</head><p>These harvesters use computer vision techniques in addition to techniques from machine learning to analyze webpages. In these harvesters, the main goal is to identify and extract information from web pages by interpreting them visually as a human being does. Some of these approaches use also the visual features on the deep Web pages <ref type="bibr" target="#b23">[24]</ref>. </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="6">Harvestability Factor Validation</head><p>As mentioned in Section 1, the HF can be used for evaluating a harvester in harvesting and a website in being harvested. It was also discussed that this factor can work as a design framework. To validate these claims, a collection of deep websites is studied considering the HF elements. The developed harvester by authors of this paper, as an example eort for developing a general purpose harvester, is applied on the test set.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="6.1">Test Set</head><p>To create the test set for illustrating how deep websites can be categorized based on the HF elements and how this can be used in designing a general purpose harvester, a set of websites from the list of top-100 job vacancy websites by <ref type="bibr" target="#b24">[25]</ref>. In the selection of websites from this list, the ones including job boards are considered. To extend this test set, a set of Dutch job vacancy websites are also considered. For each of these websites, all the elements of HF are studied. To examine the harvester performance on each one of the categories, the harvester is applied on the websites.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="6.2">Developed Harvester</head><p>The developed harvester is a HTML-based harvester which automates loading of pages in a browser. These features help to resolve the challenges caused by some of the websites' features mentioned in Section 4. For example, to enable the harvester of implementing embedded scripts in HTML pages, the techniques for automating browsers are applied. Also, for selecting the points of interests, HTML-based techniques are considered. These features also help the harvester to meet the general requirements mentioned in Subsection 5.1 like automation, scalability, independency, eciency, and being easy to use. For eciency purposes, dierent query generation mechanism could be applied to have the most amount of data harvested with the least possible number of posed queries. The conguration is limited to entering the template, and XPaths for points of interests. There is also no need to enter a data model for data storage. Given these congurations for each website, high scalability level can be achieved. Domainindependency is also highly achieved through using only HTML-based techniques which also makes it language-independent.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="6.3">HF Validation as a Framework</head><p>HF as a Design Framework Through this study, it is shown how these websites are categorized by applying the HF elements and how this can guide the design and implementation of a harvester. Having studied the set of deep websites and prioritizing the features of deep websites, By applying this harvester on this set of websites, it is shown how these features are eective on harvesting processes in practice.</p><p>Results Studying this set of websites from the domain of job vacancies brings a number of facts into light. If we assume this set of websites represents the job vacancies domain, the results can guide the design process by emphasizing on the elements of HF faced more frequently. As it can be seen in Table <ref type="table" target="#tab_0">6</ref>.1, embedded scripts, query interfaces, data layouts, and in-persistent data patterns need further attention during the harvester design process.</p><p>Being based on browsers enables our harvester to overcome some of the challenges caused by embedded scripting languages in HTML pages. This is perfectly valid when there is no change of content based on user interaction with the page. However, presence of scripts changing the content based on user interaction or change of browser or time makes it more dicult for the harvester. Simulating user actions or changes in the page environment and comparing the generated result page with the previous version of the page should be performed to be capable of harvesting the page presented to users. This part is not included in our current version of harvester. However, it is worth mentioning that this type of scripts was not faced in our test collection. So, it was reasonable to postpone the implementation of this feature.</p><p>The second most common HF element in the test set is detecting query interfaces. In all the cases, our harvester could detect the template and query the As it can be seen in Table <ref type="table" target="#tab_0">6</ref>.1, for some of the HF elements, no websites in the test set were found. This might be due to the specications of the test domain.</p><p>For example, the application of techniques like Applet or Flash could be seen more frequently in domains like Graphics or Music industries and not so often in job vacancy domain. The same applies to requiring credentials to view job vacancies which is unacceptable in business models of these companies. It is also worth mentioning that dening some of these elements in HF for a website is time-consuming and sometimes hard. Persistent coding practices is one of those elements. It is time-consuming to study a website if it follows a persistent coding paradigm unless you face an exception.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="6.4">Validation of Harvestability Factor as a Website/Harvester Evaluator</head><p>In this part, the ability of the HF in evaluating the harvestability of a website or a harvester is discussed. As mentioned in Section 2, assigning values to weights and features in the HF W Formula is beyond the scope of this paper. However, to show how this could be benecial, we use a simple method to assign these numbers. All the values are assigned with probabilities. We assign the percentage of feature As discussed in Section 6, the elements of the introduced harvestability factor can categorize deep websites based on their features which are important in harvesting process. This enables the owners of deep websites and website designers of evaluating where their products stand from harvesting point of view. This helps them to decide about which measures to take in order to follow their policies whether it is increasing access or limiting it. For harvester designers, the harvestabiltiy factor acts not only as an evaluation metric of how well the harvester can behave in practice dealing with dierent websites, it also behaves as a framework for designing deep web harvesters. The HF provides designer with a thorough list of requirements they should meet and also helps to prioritize the features to be addressed and included in the harvester. Categorizing deep websites based on their harvestabiltiy factors makes it feasible to understand the importance of dierent websites' features. This helps to prioritize the features to be addressed and included in the harvester.</p><p>Having the HF as a comparison metric for dierent deep web harvesters is another advantage of this introduced concept. To show how this can be applied, we tested the formula for our own developed harvester on a predened set of job vacancy websites. To enable the measuring, we applied simple methods in assigning values. The importance of each element was judged in a combination of author experience and expertise with the frequency of usage of that element among the test set websites. Having more than half of the elements absent among the websites gave an advantage to the harvester to get a high score. Of course, this shows that harvester would work very well for this set. However, judging its performance for a bigger or dierent domain needs new values for each parameter in the formula. This is realized if the average values for each parameter in the formula are assigned. This enables developers to decide what to include in a harvester and predict the outcome in accurate numbers even before running the harvester on the target websites.</p><p>For the next step, we will study how to assign more accurate values automatically. This means having websites classied based on the introduced elements and judging about the importance of each element in a more automatic approach.</p><p>Also, having average values to calculate the performance of a harvester in more general domains is in the list of our future work. As another future work, we aim at using the HF in guiding us in developing a more general deep web harvester.</p><p>Using the studies performed in this paper and extending them to a bigger test set will help us in deciding on the features our deep web harvester should include and prioritizing their developments.</p><p>8 Acknowledgement</p></div><figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_0"><head>7 .</head><label>7</label><figDesc>Harvesters based on a combination of previous categories. For example, in a harvester based on HTML structure, applying machine learning techniques could help in having more precise extraction results.</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_0"><head>Table 6 .</head><label>6</label><figDesc>1.  Categorizing Websites from the Test Set based on the HF Elements Among the websites in the test set, 15 percent of the websites have limitation on browsing the number of viewed search results. To resolve this problem, dierent query generation mechanisms are applied which allow ecient harvesting of deep website. The harvester can also detect if stopwords are indexed or not and send the next queries accordingly. These meet two other common HF elements mentioned in Table6.1.Among the samples, it was observed that users are asked to enable the cookies for the website. This technique is becoming more frequently used by web developers. Therefore, harvesters should accordingly be able to recognize and resolve it. To resolve other session management techniques, keeping the session information and tracking the navigation path to the page are useful. In a not</figDesc><table><row><cell>Harvestability Factor's Element</cell><cell>Percentage of Sample Websites Having the Element ( Common f eature ) and</cell><cell>The Harvester Performance HarvestF ailure f eature =1-success_rate</cell></row><row><cell></cell><cell>Critical f eature</cell><cell></cell></row><row><cell>Embedded Script in HTML 4.1</cell><cell>100 percent , Very Critical (75/100)</cell><cell>Harvester was successful in dealing with this element for all the cases. -&gt; 0</cell></row><row><cell>Applet / Flash 4.1</cell><cell>0 percent , Highly Critical (100/100)</cell><cell>This feature is not included. In case of facing this element, harvester fails. -&gt;1</cell></row><row><cell>Data Layout (dierent layouts) 4.3</cell><cell>26 percent , Critical (50/100)</cell><cell>Harvester needs pre-conguration for dierent page templates. -&gt; 0.7</cell></row><row><cell>Navigation (not straight-forward) 4.2</cell><cell>2 percent , Very Critical (75/100)</cell><cell>Successful (can dierentiate only BTW search result pages and detailed pages) -&gt; 0.5</cell></row><row><cell>Muli-page data source 4.3</cell><cell>2 percent , Critical (50/100)</cell><cell>Harvester needs pre-conguration. -&gt; 0.8</cell></row><row><cell>Search Policies (limited search results) 4.2</cell><cell>14 percent , Critical (50/100)</cell><cell>Using dierent query generation mechanisms resolves this situation -&gt; 0.1</cell></row><row><cell></cell><cell></cell><cell>Harvester detects if</cell></row><row><cell>Indexing Policies (not stopwords) 4.2</cell><cell>10 percent , Critical (50/100)</cell><cell>stopwords are indexed or not and sends next queries</cell></row><row><cell></cell><cell></cell><cell>accordingly -&gt; 0.1</cell></row><row><cell>HTML Coding Practices (not persistent) 4.1</cell><cell>0 percent (all sample websites are persistent in coding) , Critical (50/100)</cell><cell>(problem as it is HTML-based) -&gt; 0.8</cell></row><row><cell></cell><cell>0 percent (no websites with</cell><cell></cell></row><row><cell>Security / Privacy / Legal Policies 4.2</cell><cell>username, pass, or limitation for bots), Very Critical</cell><cell>1</cell></row><row><cell></cell><cell>(75/100)</cell><cell></cell></row><row><cell>URL Redirection 4.1</cell><cell>14 percent , Critical (50/100)</cell><cell>0</cell></row><row><cell>Residing Data (text, no structure) 4.3</cell><cell>10 percent , Critical (50/100)</cell><cell>0</cell></row><row><cell>Session Management 4.1</cell><cell>2 percent , Very Critical (75/100)</cell><cell>dealing with cookies -&gt; 0</cell></row><row><cell></cell><cell>100 percent (all have text</cell><cell></cell></row><row><cell>Query Interface Type 4.2</cell><cell>search or browsing features) ,</cell><cell>Successful -&gt; 0</cell></row><row><cell></cell><cell>Very Critical (75/100)</cell><cell></cell></row><row><cell>Persistent Data Patterns (not</cell><cell>24 percent , Very Critical</cell><cell>Successful if the data layout</cell></row><row><cell>persistent) 4.3</cell><cell>(75/100)</cell><cell>is dened -&gt; 0.2</cell></row><row><cell></cell><cell>0 percent (no website with</cell><cell></cell></row><row><cell>Multi-frames 4.1</cell><cell>framing issues) , Very</cell><cell>0.8</cell></row><row><cell></cell><cell>Critical (75/100)</cell><cell></cell></row></table><note>straight-forward search navigation website, which results in more steps than going through search, browsing results page, and viewing the detailed page, the developed harvester could work successfully. This was provided that there are only two types of page templates; search results page, and detailed page templates. The harvester can distinguish only these two types.</note></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_1"><head></head><label></label><figDesc>occurrence in the test set as the Co f . The F a f values are calculated through F a f = 1 − success r ate f formula. The success r ate f are assigned by the authors of this paper based on the capability of the developed harvester in resolving the problems caused by each feature. Introducing a more accurate method for these values will be studied as future work. The (C r f ) values are assigned based on the Eective not Critical (0.25), and no eect (0). Having assigned all the present parameters in the formula with values, the HF H can be calculated. The best score is the result of having all the features equal to 1 which results in 15.Our developed harvester score is 14.783. In the following line, it is shown how this number is calculated. This high number tells us that the harvester works well for this targeted domain. Having nine features absent in the websites tested in this domain gives a high advantage to this harvester. Of course, by having average numbers for each parameter of the HF formula, the harvester performance can be tested generally. In this part, we only show the HF of the harvester for a</figDesc><table><row><cell>authors experience and the results observed during experiments. They represent</cell></row><row><cell>how inuential is the corresponding feature in the whole harvesting process. We</cell></row><row><cell>assign them with four values; Highly Critical (1), Very Critical (0.75), Critical (0.5), limited test set.</cell></row><row><cell>HF H (DevelopedHarvester) = 9 + (1 − ( 26 100 × 50 100 × 70 100 )) + (1 − ( 2 100 × 75 100 × 50 100 )) + (1 − ( 2 100 × 100 × 80 50 100 )) + (1 − ( 14 100 × 50 100 × 10 100 )) + (1 − ( 10 100 × 50 100 × 10 100 )) + (1 − ( 24 100 × 75 100 × 20 100 )) = 14.783</cell></row><row><cell>7 Conclusions and Future Work</cell></row></table></figure>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="2" xml:id="foot_0">In<ref type="bibr" target="#b14">[15]</ref>, two more steps are also considered for a harvester; discovering deep web sources of interest, and presenting extracted data to users and providing them with posing query mechanisms.</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="3" xml:id="foot_1">This categorization is introduced in [8] except number 6 and 7 which are added by authors of this paper.</note>
		</body>
		<back>

			<div type="acknowledgement">
<div xmlns="http://www.tei-c.org/ns/1.0"><p>We thank the WCC Company for hosting the rst author and Jan de Vos, Eliska Went, and Marko Smiljani¢ for their support, discussions, and valuable input. This publication is supported by the Dutch national program COMMIT.</p></div>
			</div>

			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<analytic>
		<title level="a" type="main">Crawling deep web entity pages</title>
		<author>
			<persName><forename type="first">Y</forename><surname>He</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Xin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Ganti</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Rajaraman</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Shah</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, WSDM &apos;13</title>
				<meeting>the Sixth ACM International Conference on Web Search and Data Mining, WSDM &apos;13<address><addrLine>New York, NY, USA</addrLine></address></meeting>
		<imprint>
			<publisher>ACM</publisher>
			<date type="published" when="2013">2013</date>
			<biblScope unit="page">355364</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">Extracting and Querying a Comprehensive Web Database</title>
		<author>
			<persName><forename type="first">M</forename><surname>Cafarella</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the Conference on Innovative Data Systems Research (CIDR)</title>
				<meeting>the Conference on Innovative Data Systems Research (CIDR)</meeting>
		<imprint>
			<date type="published" when="2009">2009</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<analytic>
		<title level="a" type="main">Google&apos;s Deep Web crawl</title>
		<author>
			<persName><forename type="first">J</forename><surname>Madhavan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Ko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Kot</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Ganapathy</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Rasmussen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Halevy</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proc. VLDB Endow</title>
				<meeting>VLDB Endow</meeting>
		<imprint>
			<date type="published" when="2008-08">Aug. 2008</date>
			<biblScope unit="volume">1</biblScope>
			<biblScope unit="page">12411252</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b3">
	<analytic>
		<title level="a" type="main">Client-side deep web data extraction</title>
		<author>
			<persName><forename type="first">M</forename><surname>Alvarez</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Pan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Raposo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Vina</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference, CEC-EAST &apos;04</title>
				<meeting>the E-Commerce Technology for Dynamic E-Business, IEEE International Conference, CEC-EAST &apos;04<address><addrLine>Washington, DC, USA</addrLine></address></meeting>
		<imprint>
			<publisher>IEEE Computer Society</publisher>
			<date type="published" when="2004">2004</date>
			<biblScope unit="page">158161</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<monogr>
		<title level="m" type="main">Siphoning hidden-web data through keyword-based interfaces</title>
		<author>
			<persName><forename type="first">L</forename><surname>Barbosa</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Freire</surname></persName>
		</author>
		<editor>SBBD</editor>
		<imprint>
			<date type="published" when="2004">2004</date>
			<biblScope unit="page">309321</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<analytic>
		<title level="a" type="main">Downloading textual hidden web content through keyword queries</title>
		<author>
			<persName><forename type="first">A</forename><surname>Ntoulas</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Zerfos</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Cho</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 5th ACM/IEEE-CS joint conference on Digital libraries, JCDL &apos;05</title>
				<meeting>the 5th ACM/IEEE-CS joint conference on Digital libraries, JCDL &apos;05<address><addrLine>New York, NY, USA</addrLine></address></meeting>
		<imprint>
			<publisher>ACM</publisher>
			<date type="published" when="2005">2005</date>
			<biblScope unit="page">100109</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b6">
	<analytic>
		<title level="a" type="main">Crawling the hidden web</title>
		<author>
			<persName><forename type="first">S</forename><surname>Raghavan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Garcia-Molina</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 27th International Conference on Very Large Data Bases, VLDB &apos;01</title>
				<meeting>the 27th International Conference on Very Large Data Bases, VLDB &apos;01<address><addrLine>San Francisco, CA, USA</addrLine></address></meeting>
		<imprint>
			<publisher>Morgan Kaufmann Publishers Inc</publisher>
			<date type="published" when="2001">2001</date>
			<biblScope unit="page">129138</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b7">
	<analytic>
		<title level="a" type="main">A brief survey of web data extraction tools</title>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">H F</forename><surname>Laender</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><forename type="middle">A</forename><surname>Ribeiro-Neto</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">S</forename><surname>Da Silva</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">S</forename><surname>Teixeira</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">SIGMOD Rec</title>
		<imprint>
			<biblScope unit="volume">31</biblScope>
			<biblScope unit="page">8493</biblScope>
			<date type="published" when="2002-06">June 2002</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b8">
	<monogr>
		<title level="m" type="main">From information to knowledge: harvesting entities and relationships from web sources</title>
		<author>
			<persName><forename type="first">G</forename><surname>Weikum</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Theobald</surname></persName>
		</author>
		<editor>PODS (J. Paredaens and D. V. Gucht</editor>
		<imprint>
			<date type="published" when="2010">2010</date>
			<publisher>ACM</publisher>
			<biblScope unit="page">6576</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b9">
	<analytic>
		<title level="a" type="main">Deep web data extraction</title>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">L</forename><surname>Hong</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Systems Man and Cybernetics (SMC)</title>
				<imprint>
			<date type="published" when="2010">2010. 2010</date>
			<biblScope unit="page">34203427</biblScope>
		</imprint>
	</monogr>
	<note>IEEE International Conference on</note>
</biblStruct>

<biblStruct xml:id="b10">
	<analytic>
		<title level="a" type="main">Overview of web content mining tools</title>
		<author>
			<persName><forename type="first">A</forename><surname>Herrouz</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Khentout</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Djoudi</surname></persName>
		</author>
		<idno>. abs/1307.1024</idno>
	</analytic>
	<monogr>
		<title level="j">CoRR</title>
		<imprint>
			<date type="published" when="2013">2013</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b11">
	<analytic>
		<title level="a" type="main">Article: Web content mining techniques: A survey</title>
		<author>
			<persName><forename type="first">F</forename><surname>Johnson</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">K</forename><surname>Gupta</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">International Journal of Computer Applications</title>
		<imprint>
			<biblScope unit="volume">47</biblScope>
			<biblScope unit="page">4450</biblScope>
			<date type="published" when="2012-06">June 2012</date>
		</imprint>
	</monogr>
	<note>Full text available</note>
</biblStruct>

<biblStruct xml:id="b12">
	<monogr>
		<title level="m" type="main">Designing a general deep web access approach based on a newly introduced factor; harvestability factor (hf )</title>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">M</forename><surname>Khelghati</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Van Keulen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Hiemstra</surname></persName>
		</author>
		<idno>TR-CTIT-14-08</idno>
		<imprint>
			<date type="published" when="2014-06">June 2014</date>
		</imprint>
		<respStmt>
			<orgName>Centre for Telematics and Information Technology, University of Twente, Enschede</orgName>
		</respStmt>
	</monogr>
	<note type="report_type">Technical Report</note>
</biblStruct>

<biblStruct xml:id="b13">
	<monogr>
		<ptr target="http://en.wikipedia.org/wiki/Dynamic_web_page" />
		<title level="m">Dynamic web</title>
				<imprint>
			<date type="published" when="2013">2013</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b14">
	<analytic>
		<title level="a" type="main">Exploration of deep web repositories</title>
		<author>
			<persName><forename type="first">N</forename><surname>Zhang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Das</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">PVLDB</title>
		<imprint>
			<biblScope unit="volume">4</biblScope>
			<biblScope unit="issue">12</biblScope>
			<biblScope unit="page">15061507</biblScope>
			<date type="published" when="2011">2011</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b15">
	<monogr>
		<ptr target="http://www.gooseeker.com/en/node/knowledgebase/freeformat" />
		<title level="m">What is freeformat</title>
				<imprint>
			<date type="published" when="2013">2013</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b16">
	<analytic>
		<title level="a" type="main">Roadrunner: Towards automatic data extraction from large web sites</title>
		<author>
			<persName><forename type="first">V</forename><surname>Crescenzi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Mecca</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Merialdo</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 27th International Conference on Very Large Data Bases, VLDB &apos;01</title>
				<meeting>the 27th International Conference on Very Large Data Bases, VLDB &apos;01<address><addrLine>San Francisco, CA, USA</addrLine></address></meeting>
		<imprint>
			<publisher>Morgan Kaufmann Publishers Inc</publisher>
			<date type="published" when="2001">2001</date>
			<biblScope unit="page">109118</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b17">
	<analytic>
		<title level="a" type="main">Machine learning for information extraction in informal domains</title>
		<author>
			<persName><forename type="first">D</forename><surname>Freitag</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Mach. Learn</title>
		<imprint>
			<biblScope unit="volume">39</biblScope>
			<biblScope unit="page">169202</biblScope>
			<date type="published" when="2000-05">May 2000</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b18">
	<analytic>
		<title level="a" type="main">Hierarchical wrapper induction for semistructured information sources</title>
		<author>
			<persName><forename type="first">I</forename><surname>Muslea</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Minton</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><forename type="middle">A</forename><surname>Knoblock</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Autonomous Agents and Multi-Agent Systems</title>
		<imprint>
			<biblScope unit="volume">4</biblScope>
			<biblScope unit="page">93114</biblScope>
			<date type="published" when="2001-03">Mar. 2001</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b19">
	<analytic>
		<title level="a" type="main">Wrapper induction: Eciency and expressiveness</title>
		<author>
			<persName><forename type="first">N</forename><surname>Kushmerick</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Artif. Intell</title>
		<imprint>
			<biblScope unit="volume">118</biblScope>
			<biblScope unit="page">1568</biblScope>
			<date type="published" when="2000-04">Apr. 2000</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b20">
	<analytic>
		<title level="a" type="main">Nodose -a tool for semi-automatically extracting structured and semistructured data from text documents</title>
		<author>
			<persName><forename type="first">B</forename><surname>Adelberg</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">SIGMOD Record</title>
				<imprint>
			<date type="published" when="1998">1998</date>
			<biblScope unit="page">283294</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b21">
	<analytic>
		<title level="a" type="main">Extracting semi-structured data through examples</title>
		<author>
			<persName><forename type="first">B</forename><surname>Ribeiro-Neto</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">H F</forename><surname>Laender</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">S</forename><surname>Da Silva</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the Eighth International Conference on Information and Knowledge Management, CIKM &apos;99</title>
				<meeting>the Eighth International Conference on Information and Knowledge Management, CIKM &apos;99<address><addrLine>New York, NY, USA</addrLine></address></meeting>
		<imprint>
			<publisher>ACM</publisher>
			<date type="published" when="1999">1999</date>
			<biblScope unit="page">94101</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b22">
	<analytic>
		<title level="a" type="main">Conceptual-model-based data extraction from multiplerecord web pages</title>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">W</forename><surname>Embley</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">M</forename><surname>Campbell</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><forename type="middle">S</forename><surname>Jiang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">W</forename><surname>Liddle</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">W</forename><surname>Lonsdale</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y.-K</forename><surname>Ng</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><forename type="middle">D</forename><surname>Smith</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Data Knowl. Eng</title>
		<imprint>
			<biblScope unit="volume">31</biblScope>
			<biblScope unit="page">227251</biblScope>
			<date type="published" when="1999-11">Nov. 1999</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b23">
	<analytic>
		<title level="a" type="main">Vide: A vision-based approach for deep web data extraction</title>
		<author>
			<persName><forename type="first">W</forename><surname>Liu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><surname>Meng</surname></persName>
		</author>
		<author>
			<persName><forename type="first">W</forename><surname>Meng</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">IEEE Transactions on Knowledge and Data Engineering</title>
		<imprint>
			<biblScope unit="volume">22</biblScope>
			<biblScope unit="issue">3</biblScope>
			<biblScope unit="page">447460</biblScope>
			<date type="published" when="2010">2010</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b24">
	<monogr>
		<ptr target="http://www.forbes.com/sites/jacquelynsmith/2013/09/18/the-top-100-websites-for-your-career/" />
		<title level="m">The top 100 websites for your career</title>
				<imprint>
			<date type="published" when="2013">2013</date>
		</imprint>
	</monogr>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
