Filters








11,241 Hits in 6.2 sec

Enhanced Crawler with Multiple Search Techniques using Adaptive Link-Ranking and Pre-Query Processing

Suchetadevi M. Gaikwad, Sanjay B. Thakare
2016 Circulation in Computer Science  
For further enhancement, our system ranks and priorities websites and also uses a link tree data structure to achieve deep coverage.  ...  We proposed a three stage framework, an Enhanced Crawler, for efficiently gathering deep web interfaces.  ...  ACKNOWLEDGMENTS The authors would like to thank the researchers as well as publishers for making their resources available and teachers of RSCOE, Computer Engineering for their guidance.  ... 
doi:10.22632/ccs-2016-251-24 fatcat:nxtgm7lvlfcwdnqkcfkamctiju

A Top-K-Based Cache Model for Deep Web Query

Yue Kou, Derong Shen, Ge Yu, Tiezheng Nie, Dong Li
2007 Proceedings of the 2nd International ICST Conference on Scalable Information Systems  
In this paper we focus on providing a cache model based on Top-K data source instead of expatiatory result records for deep web query.  ...  By integrating techniques from IR and Top-K, a data reorganization strategy is presented.  ...  We focus on providing a Top-K-based cache model for deep web query. Through analyzing feasibilities, an effective cache structure is defined.  ... 
doi:10.4108/infoscale.2007.965 dblp:conf/infoscale/KouSYNL07 fatcat:lk42yb4iovd5jppxiqwphnf2di

Deep Web Interface Completely Harvested and Reranked by Crawler
ENGLISH

Amruta Pandit,, Prof.Manisha Naoghare
2016 International Journal of Innovative Research in Computer and Communication Engineering  
Now a days there are increasing numbers of data sources which become available on the web, but often their contents are only accessible through query interface.  ...  For harvesting deep web interface problem proposed framework is used and the Parsing process takes place.  ...  RE-RANKING OF URL: In between the vast amount of database there is need of re ranking of data is module are used for this task. D. ALGORITHM: TOP K PRUNING IV.  ... 
doi:10.15680/ijircce.2016.0410005 fatcat:3fk5vk4g6jg3hb2fpncmbkxi6e

Ranking bias in deep web size estimation using capture recapture method

Jianguo Lu
2010 Data & Knowledge Engineering  
Many deep web data sources are ranked data sources, i.e., they rank the matched documents and return at most the top k number of results even though there are more than k documents matching the query.  ...  While estimating the size of such ranked deep web data source, it is well known that there is a ranking biasthe traditional methods tend to underestimate the size when queries overflow ( match more documents  ...  The author would like thank the reviewers for their detailed comments, Dr. Dingding Li for very insightful discussions, and Jie Liang for preparing the data in the experiments.  ... 
doi:10.1016/j.datak.2010.03.007 fatcat:lo6ayip7crcfbp5zllmhdftns4

Discovering Interesting Relationships among Deep Web Databases: A Source-Biased Approach

James Caverlee, Ling Liu, Daniel Rocco
2006 World wide web (Bussum)  
Unlike the Bsurface^web of static pages, these deep web databases provide data through a web-based query interface and account for a huge portion of all web content.  ...  This paper presents a novel sourcebiased approach to efficiently discover interesting relationships among web-enabled databases on the deep web.  ...  Our experiments on both simulation and web datasets show how the sourcebiased database analysis approach results in efficient discovery and ranking of deep web databases.  ... 
doi:10.1007/s11280-006-0227-7 fatcat:44l2fk274nhgxpq3x6xrjcfl4u

Ranked queries over sources with Boolean query interfaces without ranking support

Vagelis Hristidis, Yuheng Hu, Panagiotis G. Ipeirotis
2010 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010)  
In this paper we present algorithms that return the top results for a query, ranked according to an IR-style ranking function, while operating on top of a source with a Boolean query interface with no  ...  Many online or local data sources provide powerful querying mechanisms but limited ranking capabilities.  ...  CONCLUSIONS We presented a framework and efficient algorithms to build a ranking wrapper on top of a documents data source that only serves Boolean keyword queries.  ... 
doi:10.1109/icde.2010.5447918 dblp:conf/icde/HristidisHI10 fatcat:vzjsd5jzfjhk5h3aphrfxwnf3u

Special issue on querying the data web

Paolo Ceravolo, Chengfei Liu, Mustafa Jarrar, Kai-Uwe Sattler
2011 World wide web (Bussum)  
On the other side, traditional structured querying languages cannot be used directly as data on the Data Web is heterogeneous, large, distributed, schema-free, and not intuitive for web users.  ...  The rapid growth of structured data on the Web has created a high demand for making this content more reusable and consumable.  ...  It focuses on using data summaries accessed during query evaluation for determining relevant sources to yield current query results.  ... 
doi:10.1007/s11280-011-0139-z fatcat:73bpqsnpvfcbhlvlzup3mc34iu

SemLAV: Querying Deep Web and Linked Open Data with SPARQL [chapter]

Pauline Folz, Gabriela Montoya, Hala Skaf-Molli, Pascal Molli, Maria-Esther Vidal
2014 Lecture Notes in Computer Science  
SemLAV allows to execute SPARQL queries against the Deep Web and Linked Open Data data sources. It implements the mediatorwrapper architecture based on view definitions over remote data sources.  ...  SPARQL queries are expressed using a mediator schema vocabulary, and SemLAV selects relevant data sources and rank them.  ...  In this paper, we demonstrate how SemLAV is able to quickly deliver results for SPARQL queries mixing Deep Web data sources and Linked Open Data defined using around 250 views.  ... 
doi:10.1007/978-3-319-11955-7_44 fatcat:tjthxwsu25f6lblomdmmtyrc6e

Face retriever: Pre-filtering the gallery via deep neural net

Dayong Wang, Anil K. Jain
2015 2015 International Conference on Biometrics (ICB)  
The top-k most similar faces are then re-ranked based on score-level fusion of the similarities between deep features and the COTS matcher.  ...  In particular, given a query face, we first pre-filter the gallery set and find the top-k most similar faces for the query image by using deep facial features that are learned with a deep convolutional  ...  However, ranking based on the similarities of the query face image to the top-k face images alone does not make use of the intrinsic structure of the top-k most similar facial images.  ... 
doi:10.1109/icb.2015.7139112 dblp:conf/icb/WangJ15 fatcat:cxpdmj6dkzejxjw7idhdbykhoq

Towards a Statistically Semantic Web [chapter]

Gerhard Weikum, Jens Graupmann, Ralf Schenkel, Martin Theobald
2004 Lecture Notes in Computer Science  
for large-scale dynamic federations of Deep Web sources.  ...  from users' query logs and click streams can be leveraged for better search result ranking.  ...  Efficient Top-k Query Processing with Probabilistic Pruning For ranked retrieval of semistructured, "semantically" annotated data, we face the problem of reconciling efficiency with result quality.  ... 
doi:10.1007/978-3-540-30464-7_2 fatcat:sva3zylsrbdv7ge7wr5jy6ux6u

Exploration and mining of web repositories

Nan Zhang, Gautam Das
2014 Proceedings of the 7th ACM international conference on Web search and data mining - WSDM '14  
by the scoring function used to select top-k tuples • e.g., skew on average price when the top-k elements are the ones with the lowest prices  Basic idea for reducing/removing skew o Find non-empty queries  ...  ICDM 2010 [WA11] Fan Wang, Gagan Agrawal: Effective and efficient sampling methods for deep web aggregation queries.  ...  • Level 1: a query is needed to determine whether user A befriends B. • Level 2: a query reveals the list of user A's friends. • Level 3: a query reveals the list of user A's friends, as well as the degree  ... 
doi:10.1145/2556195.2556197 dblp:conf/wsdm/0004D14 fatcat:qd3n4ceurrhbxpyw5ix3vcoe3q

Integrating and querying web databases and documents

Carlos Garcia-Alvarado, Carlos Ordonez
2011 Proceedings of the 20th ACM international conference on Information and knowledge management - CIKM '11  
Web document data include files, documents and web pages. Links between metadata and external documents are built with SQL queries.  ...  That is, we tackle the problem of integrating information in the deep web, departing from databases.  ...  Our system incorporates new optimizations, including efficient and approximate matching, link ranking and adapting the Rank-Join approach for top-k querying [6] .  ... 
doi:10.1145/2063576.2063969 dblp:conf/cikm/Garcia-AlvaradoO11 fatcat:oztawwddrnhurhu4qbph5oj54u

Computing PageRank in a Distributed Internet Search System [chapter]

Yuan Wang, David J. DeWitt
2004 Proceedings 2004 VLDB Conference  
Existing Internet search engines use web crawlers to download data from the Web. Page quality is measured on central servers, where user queries are also processed.  ...  results. 1 167 TB in surface web, 91,850 TB in deep web, 18.7 KB per page [19]. 2 Claimed on http://www.google.com as of June 2004.  ...  Acknowledgement We would thank the anonymous reviewers for their valuable comments. The authors are supported by the NSF under grant number ITR-0086002.  ... 
doi:10.1016/b978-012088469-8.50039-5 dblp:conf/vldb/WangD04 fatcat:stytw3tawrcrlm3d6fln6sukqy

Computing PageRank in a Distributed Internet Search System [chapter]

Y WANG, D DEWITT
2004 Proceedings 2004 VLDB Conference  
Existing Internet search engines use web crawlers to download data from the Web. Page quality is measured on central servers, where user queries are also processed.  ...  results. 1 167 TB in surface web, 91,850 TB in deep web, 18.7 KB per page [19]. 2 Claimed on http://www.google.com as of June 2004.  ...  Acknowledgement We would thank the anonymous reviewers for their valuable comments. The authors are supported by the NSF under grant number ITR-0086002.  ... 
doi:10.1016/b978-012088469-8/50039-5 fatcat:6w2p746ywvczhpiztwzzwpfhoy

Web-Based Image Retrieval with a Case Study [chapter]

Ying Liu, Danqing Zhang
2003 Lecture Notes in Computer Science  
Advances in content-based image retrieval(CBIR)lead to numerous efficient techniques for retrieving images based on their content features, such as colours, textures and shapes.  ...  local rankings from heterogeneous sources than using the commonly used method of assigning different weights.  ...  The second author would like to thank Professor Binh Pham and Dr Xuefeng Li of QUT for many helpful discussions on the topic of texture-based CBIR.  ... 
doi:10.1007/3-540-36901-5_41 fatcat:kvrhbcliznaulicqguj4zarpiq
« Previous Showing results 1 — 15 out of 11,241 results