
Query Selection in Deep Web Crawling
Help your crawler efficiently retrieve data from the largest data sources in the Web
- Publisher's listprice EUR 44.90
-
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 5% (cc. 952 Ft off)
- Discounted price 18 094 Ft (17 232 Ft + 5% VAT)
19 046 Ft
Availability
printed on demand
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Publisher Scholar's Press
- Date of Publication 1 January 2014
- ISBN 9783639712452
- Binding Paperback
- No. of pages152 pages
- Size 220x150x8 mm
- Weight 218 g
- Language English 0
Categories
Long description:
The deep web is the content that is dynamically generated from data sources such as databases or file system. Unlike surface web where web pages are collected by following the hyperlinks embedded inside collected pages, data from a deep web data source is guarded by a search interface and only can be retrieved by queries. The amount of data in deep web exceeds by far that of the surface web. This calls for deep web crawlers to excavate the data so that they can be used, indexed, and searched upon in an integrated environment. Crawling deep web is the process of collecting data from search interfaces by issuing queries. One of the major challenges in crawling deep web is the selection of the queries so that most of the data can be retrieved at a low cost. This work first comprehensively introduces the state-of-art work in query selection techniques for crawling, then in-depth analyzes the remaining problems, such as cold start problem and return limit problem, and finally presents a novel technique to address them.
More
Logarithmic Potentials with External Fields
Subcribe now and receive a favourable price.
Subscribe
22 690 HUF

Advances in Fault Detection and Diagnosis Using Filtering Analysis
Subcribe now and receive a favourable price.
Subscribe
54 463 HUF

Query Selection in Deep Web Crawling: Help your crawler efficiently retrieve data from the largest data sources in the Web
Subcribe now and receive a favourable price.
Subscribe
19 046 HUF

Polynomial Approximation on Polytopes
Subcribe now and receive a favourable price.
Subscribe
34 784 HUF