Titlebook: Database Systems for Advanced Applications; 18th International C Weiyi Meng,Ling Feng,Wei Song Conference proceedings 2013 Springer-Verlag

弄皺

無孔

Community Expansion in Social Networken a greedy algorithm . is developed for expanding a community over time. Our results from extensive simulation on several real-world networks demonstrate that our Combine Model performs effectively and outperforms other algorithms.

ADORN

Similarity Joins on Item Set Collections Using Zero-Suppressed Binary Decision Diagramsagrams (BDDs), and are suitable for implicitly handling large-scale combinatorial item set data. We present, in this paper, the algorithms for similarity joins between two data collections represented as ZDDs and pruning techniques. We also present the experimental results obtained by comparing thei

墊子

Adaptive Query Scheduling in Key-Value Data Stores To this end, we propose the . scheduling strategy, which allows for selective data refreshing and integrates the benefits of SJF-based scheduling with an EDF-like policy. Our experiments demonstrate the effectiveness of our method, which does not only strike a fine trade-off between QoS and QoD but

TAG

Distributed AH-Tree Based Index Technology for Multi-channel Wireless Data Broadcasto the best of our knowledge, we are the first to propose a detailed, fast, and distributed .-ary AH-Tree index with allocation protocol, which has both theoretical and practical significance in this area.

epicardium

Beyond Click Graph: Topic Modeling for Search Engine Query Log Analysiss the clicking behavior explicitly and models the ternary relation between search queries, query terms and URLs. We evaluate the three proposed models against several strong baselines on a real-life query log. The experimental results show that the proposed models demonstrate significantly improved

遣返回國

Continuous Topically Related Queries Grouping and Its Application on Interest IdentificationQs accurately, we propose the Pattern-Concept-Time-Based (PCTB) method that utilizes query reformulation patterns, concepts behind the queries and the user’s continuous searching behavior to compute the similarity between two queries. To evaluate the effectiveness of our approach, we employ the AOL

scotoma

Mortar

Gabriel Keehn,Morgan Anderson,Deron Boylestion are specified in user queries..Search intent discovery is a hot research area in Web search, such as search query classification (informational, navigational and transactional queries), search result diversification, and query recommendation..In this talk, after a brief survey on the research o

Infinitesimal

Contemporary Photography as Collaborationcture and domain information related to an answerer (e.g., answer quality) is critical for inferring the expertise of users. Based on this observation, we propose the . framework to compute users’ expertise. We establish that the information used has a bearing on the accuracy of results. We present