{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T18:15:06Z","timestamp":1754158506220,"version":"3.41.2"},"reference-count":17,"publisher":"Emerald","issue":"6","license":[{"start":{"date-parts":[[2018,9,18]],"date-time":"2018-09-18T00:00:00Z","timestamp":1537228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["EL"],"published-print":{"date-parts":[[2018,11,12]]},"abstract":"<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Purpose<\/jats:title>\n<jats:p>Digital library sampling is used to obtain a collection of random literature records from the backend database, which is a crucial issue for a variety of important purposes in many online digital library applications. Digital libraries can only be accessed through their query interfaces. The challenge is how to ensure the randomness of the sample via the autonomous query interface.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Design\/methodology\/approach<\/jats:title>\n<jats:p>This paper presents an iterative and incremental approach to obtain samples through the query interface of a digital library. In the approach, a novel graph model, query-related graph, is proposed to transform the flat literature records into a graph structure, and samples are obtained iteratively by traveling the query-related graph. Besides query-related graph, the key components, query generation, termination condition and amending deviation, are also discussed in detail.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Findings<\/jats:title>\n<jats:p>The extensive experiments over two real digital libraries, ISTIC and IEEE Xplore, show the proposed approach results in a better performance. First, the approach is very effective to obtain high-quality samples which are evaluated by the measure \u201csample deviation.\u201d Second, the sampling process is very efficient by only submitting fewer random queries. Third, the approach is robust.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Research limitations\/implications<\/jats:title>\n<jats:p>This sampling approach is limited by the query interfaces on a web page. In rare cases (&lt;3 per cent), this approach cannot access query interfaces by sophisticated techniques.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Practical implications<\/jats:title>\n<jats:p>Digital library sampling is very useful for a variety of important purposes: subject distribution analysis, literature quality evaluation, digital library size estimation, source selection in digital library integration and content freshness evaluation.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Social implications<\/jats:title>\n<jats:p>Myriads of online digital libraries can be accessed online. Digital library sampling is a useful way to understand digital libraries for many important applications.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Originality\/value<\/jats:title>\n<jats:p>Most of the attributes of a digital library query interface have infinite values, such as keyword attributes, which cannot be handled effectively by the existing sampling approaches.<\/jats:p>\n<\/jats:sec>","DOI":"10.1108\/el-08-2017-0163","type":"journal-article","created":{"date-parts":[[2018,9,18]],"date-time":"2018-09-18T08:11:05Z","timestamp":1537258265000},"page":"1082-1098","source":"Crossref","is-referenced-by-count":0,"title":["Online digital library sampling based on query related graph"],"prefix":"10.1108","volume":"36","author":[{"given":"Wei","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing","family":"Su","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","published-online":{"date-parts":[[2018,9,18]]},"reference":[{"issue":"2","key":"key2021041413230831100_ref001","first-page":"50","article-title":"Assessing relevance and trust of the deep web sources and results based on inter-source agreement","volume":"7","year":"2013","journal-title":"ACM Transactions on the Web"},{"key":"key2021041413230831100_ref002","first-page":"629","article-title":"A random walk approach to sampling hidden databases","volume-title":"in ACM Sigmod \u201807","year":"2007"},{"key":"key2021041413230831100_ref003","first-page":"855","article-title":"Unbiased estimation of size and other aggregates over hidden web databases","volume-title":"ACM SIGMOD International Conference on Management of Data, SIGMOD \u201810","year":"2010"},{"key":"key2021041413230831100_ref004","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/j.knosys.2014.07.007","article-title":"Web data extraction, applications and techniques: a survey","volume":"70","year":"2014","journal-title":"Knowledge-Based Systems"},{"key":"key2021041413230831100_ref005","first-page":"219","article-title":"Active learning based frequent itemset mining over the deep web","volume-title":"IEEE International Conference on Data Engineering","year":"2011"},{"issue":"12","key":"key2021041413230831100_ref006","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.14778\/2732977.2732985","article-title":"Aggregate estimation over dynamic hidden web databases","volume":"7","year":"2014","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"11","key":"key2021041413230831100_ref007","doi-asserted-by":"crossref","first-page":"2658","DOI":"10.1109\/TKDE.2012.220","article-title":"Bias correction in a small sample from big data","volume":"25","year":"2013","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"key2021041413230831100_ref008","first-page":"92","article-title":"Random sampling from database files: a survey","volume-title":"International Conference SSDBM on Statistical and Scientific Database Management","year":"1990"},{"issue":"1","key":"key2021041413230831100_ref009","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF00140664","article-title":"Random sampling from databases: a survey","volume":"5","year":"1995","journal-title":"Statistics and Computing"},{"issue":"1","key":"key2021041413230831100_ref010","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1145\/3147.3165","article-title":"Random sampling with a reservoir","volume":"11","year":"1985","journal-title":"ACM Transactions on Mathematical Software"},{"key":"key2021041413230831100_ref011","first-page":"408","article-title":"Instance-based schema matching for web databases by domain-specific query probing","volume-title":"in Thirtieth International Conference on Very Large Data Bases","year":"2004"},{"issue":"3","key":"key2021041413230831100_ref012","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/s10791-013-9230-7","article-title":"Discover hidden web properties by random walk on bipartite graph","volume":"17","year":"2014","journal-title":"Information Retrieval"},{"key":"key2021041413230831100_ref013","first-page":"9","article-title":"A deep web database sampling method based on high correlation keywords","volume-title":"in Ninth Web Information Systems and Applications Conference","year":"2012"},{"issue":"10","key":"key2021041413230831100_ref014","first-page":"1411","article-title":"A survey of web information extraction systems","volume":"18","year":"2011","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"key2021041413230831100_ref015","first-page":"324","article-title":"Stratified sampling for data mining on the deep web","volume-title":"in IEEE International Conference on Data Mining","year":"2010"},{"issue":"12","key":"key2021041413230831100_ref016","doi-asserted-by":"crossref","first-page":"1614","DOI":"10.1109\/TKDE.2006.197","article-title":"Structured data extraction from the web based on partial tree alignment","volume":"18","year":"2006","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"key2021041413230831100_ref017","first-page":"371","article-title":"Counting YouTube videos via random prefix sampling","volume-title":"in ACM SIGCOMM Conference on Internet Measurement Conference","year":"2011"}],"container-title":["The Electronic Library"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/EL-08-2017-0163\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/EL-08-2017-0163\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T01:07:51Z","timestamp":1753405671000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/el\/article\/36\/6\/1082-1098\/87389"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,18]]},"references-count":17,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2018,9,18]]},"published-print":{"date-parts":[[2018,11,12]]}},"alternative-id":["10.1108\/EL-08-2017-0163"],"URL":"https:\/\/doi.org\/10.1108\/el-08-2017-0163","relation":{},"ISSN":["0264-0473"],"issn-type":[{"type":"print","value":"0264-0473"}],"subject":[],"published":{"date-parts":[[2018,9,18]]}}}