An arXiv paper on discovering skylines over hidden web databases whose search interfaces enforce a top-k output constraint. It examines how search interface controls affect discovery cost and develops algorithms for one-ended range, free range and point predicates, combined for mixed interfaces. Experiments over real-world online and offline databases are reported.
Directory
Search results
Published directory entries matching your search.
arxiv.org
arxiv.org
An arXiv paper on digging deeper into hidden web databases limited by the top-k output constraint. It presents the GetNext meta-algorithm, which retrieves the next ranked tuple through a restrictive interface without prior knowledge of the ranking function, and algorithms that generate and execute multiple reformulated queries. Theoretical analysis and experiments over synthetic and real-world databases are reported.