Sciweavers

835 search results - page 119 / 167
» Exploiting web search engines to search structured databases
Sort
View
CIDR
2003
147views Algorithms» more  CIDR 2003»
14 years 11 months ago
Sorting And Indexing With Partitioned B-Trees
Partitioning within a B-tree, based on an artificial leading key column and combined with online reorganization, can be exploited during external merge sort for accurate deep read...
Goetz Graefe
SIGIR
2012
ACM
13 years 6 days ago
Optimizing positional index structures for versioned document collections
Versioned document collections are collections that contain multiple versions of each document. Important examples are Web archives, Wikipedia and other wikis, or source code and ...
Jinru He, Torsten Suel
CIKM
2008
Springer
14 years 11 months ago
Predicting web spam with HTTP session information
Web spam is a widely-recognized threat to the quality and security of the Web. Web spam pages pollute search engine indexes, burden Web crawlers and Web mining services, and expos...
Steve Webb, James Caverlee, Calton Pu
BMCBI
2008
144views more  BMCBI 2008»
14 years 10 months ago
PDTD: a web-accessible protein database for drug target identification
Background: Target identification is important for modern drug discovery. With the advances in the development of molecular docking, potential binding proteins may be discovered b...
Zhenting Gao, Honglin Li, Hailei Zhang, Xiaofeng L...
TREC
2004
14 years 11 months ago
Using Clustering and Blade Clusters in the Terabyte Task
Web search engines exploit conjunctive queries and special ranking criteria which differ from the disjunctive queries typically used for ad-hoc retrieval. We wanted to asses the e...
Giuseppe Attardi, Andrea Esuli, Chirag Patel