Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/1458082.1458346acmconferencesArticle/Chapter ViewAbstractPublication PagescikmConference Proceedingsconference-collections
poster

Efficient estimation of the size of text deep web data source

Published: 26 October 2008 Publication History

Abstract

No abstract available.

References

[1]
Broder, A., Fontura, M., Josifovski, V., Kumar, R., Motwani, R., Nabar, S., Panigrahy, R., Tomkins, A., and Xu, Y. Estimating corpus size via queries. CIKM '06. 594--603.
[2]
M Shokouhi, J Zobel, F Scholer, SMM Tahaghoghi, Capturing collection size for distributed non-cooperative retrieval, SIGIR '06. 316--323.

Cited By

View all
  • (2023)Federated search techniques: an overview of the trends and state of the artKnowledge and Information Systems10.1007/s10115-023-01922-665:12(5065-5095)Online publication date: 10-Jul-2023
  • (2020)Query Interface Schema Extraction for Hidden Web Resources Searching2020 7th International Conference on Information Science and Control Engineering (ICISCE)10.1109/ICISCE50968.2020.00215(1058-1062)Online publication date: Dec-2020
  • (2017)Optimized Processing of a Batch of Aggregate Queries over Hidden Databases2017 International Conference on Computer and Applications (ICCA)10.1109/COMAPP.2017.8079754(317-324)Online publication date: Sep-2017
  • Show More Cited By

Index Terms

  1. Efficient estimation of the size of text deep web data source

        Recommendations

        Comments

        Information & Contributors

        Information

        Published In

        cover image ACM Conferences
        CIKM '08: Proceedings of the 17th ACM conference on Information and knowledge management
        October 2008
        1562 pages
        ISBN:9781595939913
        DOI:10.1145/1458082
        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Sponsors

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        Published: 26 October 2008

        Permissions

        Request permissions for this article.

        Check for updates

        Author Tags

        1. deep web
        2. estimate

        Qualifiers

        • Poster

        Conference

        CIKM08
        CIKM08: Conference on Information and Knowledge Management
        October 26 - 30, 2008
        California, Napa Valley, USA

        Acceptance Rates

        Overall Acceptance Rate 1,861 of 8,427 submissions, 22%

        Upcoming Conference

        Contributors

        Other Metrics

        Bibliometrics & Citations

        Bibliometrics

        Article Metrics

        • Downloads (Last 12 months)0
        • Downloads (Last 6 weeks)0
        Reflects downloads up to 30 Aug 2024

        Other Metrics

        Citations

        Cited By

        View all
        • (2023)Federated search techniques: an overview of the trends and state of the artKnowledge and Information Systems10.1007/s10115-023-01922-665:12(5065-5095)Online publication date: 10-Jul-2023
        • (2020)Query Interface Schema Extraction for Hidden Web Resources Searching2020 7th International Conference on Information Science and Control Engineering (ICISCE)10.1109/ICISCE50968.2020.00215(1058-1062)Online publication date: Dec-2020
        • (2017)Optimized Processing of a Batch of Aggregate Queries over Hidden Databases2017 International Conference on Computer and Applications (ICCA)10.1109/COMAPP.2017.8079754(317-324)Online publication date: Sep-2017
        • (2017)Improving the freshness of the search engines by a probabilistic approach based incremental crawlerInformation Systems Frontiers10.1007/s10796-016-9701-719:5(1013-1028)Online publication date: 1-Oct-2017
        • (2013)Discover hidden web properties by random walk on bipartite graphInformation Retrieval10.1007/s10791-013-9230-717:3(203-228)Online publication date: 18-Aug-2013
        • (2012)Selecting queries from sample to crawl deep web data sourcesWeb Intelligence and Agent Systems10.5555/2589921.258992710:1(75-88)Online publication date: 1-Jan-2012
        • (2012)Sampling online social networks by random walkProceedings of the First ACM International Workshop on Hot Topics on Interdisciplinary Social Networks Research10.1145/2392622.2392628(33-40)Online publication date: 12-Aug-2012
        • (2011)Sampling hidden objects using nearest-neighbor oraclesProceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining10.1145/2020408.2020606(1325-1333)Online publication date: 21-Aug-2011
        • (2010)Understanding deep web search interfacesACM SIGMOD Record10.1145/1860702.186070839:1(33-40)Online publication date: 27-Sep-2010
        • (2010)Unbiased estimation of size and other aggregates over hidden web databasesProceedings of the 2010 ACM SIGMOD International Conference on Management of data10.1145/1807167.1807259(855-866)Online publication date: 6-Jun-2010
        • Show More Cited By

        View Options

        Get Access

        Login options

        View options

        PDF

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader

        Media

        Figures

        Other

        Tables

        Share

        Share

        Share this Publication link

        Share on social media