Sciweavers

516 search results - page 44 / 104
» Retroactive answering of search queries
Sort
View
99
Voted
WWW
2006
ACM
16 years 1 months ago
Selective hypertext induced topic search
We address the problem of answering broad-topic queries on the World Wide Web. We present a link based analysis algorithm SelHITS, which is an improvement over Kleinberg's HI...
Amit C. Awekar, Pabitra Mitra, Jaewoo Kang
180
Voted
SIGMOD
2005
ACM
161views Database» more  SIGMOD 2005»
16 years 27 days ago
Efficient Keyword Search for Smallest LCAs in XML Databases
Keyword search is a proven, user-friendly way to query HTML documents in the World Wide Web. We propose keyword search in XML documents, modeled as labeled trees, and describe cor...
Yu Xu, Yannis Papakonstantinou
88
Voted
SIGCOMM
2009
ACM
15 years 7 months ago
ROAR: increasing the flexibility and performance of distributed search
To search the web quickly, search engines partition the web index over many machines, and consult every partition when answering a query. To increase throughput, replicas are adde...
Costin Raiciu, Felipe Huici, Mark Handley, David S...
ICDE
2011
IEEE
215views Database» more  ICDE 2011»
14 years 4 months ago
Top-k keyword search over probabilistic XML data
—Despite the proliferation of work on XML keyword query, it remains open to support keyword query over probabilistic XML data. Compared with traditional keyword search, it is far...
Jianxin Li, Chengfei Liu, Rui Zhou, Wei Wang
125
Voted
FSTTCS
2004
Springer
15 years 6 months ago
Approximate Range Searching Using Binary Space Partitions
We show how any BSP tree TP for the endpoints of a set of n disjoint segments in the plane can be used to obtain a BSP tree of size O(n · depth(TP )) for the segments themselves, ...
Mark de Berg, Micha Streppel