Python Forum
Looking for good doc on Scraping coverage algorithms
Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
Looking for good doc on Scraping coverage algorithms
#1
I'm looking for documents describing (math and/or python) how to query sites for coverage of data.
My example search site for company names:
Conditions:
  • site limits results from any query to 1000 rows.
  • site allows '*' wildcard
  • query options:
    1. Exact words in exact word order.
    2. Exact words in any word order.
    3. Soundex words exact order.
    4. Soundex words any order.
    5. Extended Search in any word order.
  • Site allows query by registry number (company id), but does not allow wild cards or ranges for this option.
If I use A* obviously exceed query return limit
AA* excludes A by itself
How can I get next 1000 and so on records for A*?

Should be relatively simple, but can't wrap my mind around it.
Reply


Possibly Related Threads…
Thread Author Replies Views Last Post
  Greedy algorithms on logical problems Opensourcehacker 0 1,507 Nov-22-2020, 05:12 PM
Last Post: Opensourcehacker
Lightbulb how to get improve coverage while using coverage.py sami23 0 1,456 Jan-22-2020, 10:53 AM
Last Post: sami23
  I need help with Python code to implement this algorithms Saemmanuex 1 2,017 Jul-07-2019, 02:07 PM
Last Post: DeaD_EyE
  Python - sorting algorithms hrca 3 3,113 Nov-06-2018, 07:06 PM
Last Post: hrca
  compare algorithms tygaf 1 2,796 Feb-14-2018, 07:26 PM
Last Post: buran
  Calculate the fewest zip codes, for the largest coverage nilamo 4 6,935 Mar-23-2017, 01:31 PM
Last Post: Bass

Forum Jump:

User Panel Messages

Announcements
Announcement #1 8/1/2020
Announcement #2 8/2/2020
Announcement #3 8/6/2020