Titlebook: Web-Age Information Management; 17th International C Bin Cui,Nan Zhang,Dexi Liu Conference proceedings 2016 Springer International Publishi

严峻考验

PACOKS: Progressive Ant-Colony-Optimization-Based Keyword Search over Relational Databasesal data as a graph, and then find the minimum Steiner tree containing all the keywords by traversing the graph. However, the existing work involves substantial costs even for those based on heuristic algorithms, as the minimum Steiner tree problem is proved to be an NP-hard problem. In order to redu

大笑

兽皮

阻塞

Enhanced Query Classification with Millions of Fine-Grained Topics a big challenge in real-world applications due to the sparse, noisy and ambiguous nature of queries. In this paper, we present another important issue called “the pomegranate phenomenon”. This phenomenon is named for the gap between manually manageable small taxonomy and massive coherent topics in

让你明白

exostosis

弄污

lymphoma

An Update Method for Shortest Path Caching with Burst Paths Based on Sliding Windowsand other fields. By far, few existing methods has considered burst paths, which are common in real life. For instance, queries of a certain path can sharply increase due to a promotion or vacations. Such burst queries usually last for a relatively short period, and their frequencies are too low to

AMEND

Low Overhead Log Replication for Main Memory Database Systemse Paxos protocol to replicate log in multiple database instance sites. Since the replicated logs need to contain some metadata such as committed log sequence number (LSN), this increases the overhead of storage and network. It has significantly negative impact on the throughput in the update intens

OWL