Search arXiv⌕ Search

arXiv subjects

Rui Zhou

Publications and source records attributed to Rui Zhou.

149 records · Page 9Linked to original sources

Efficient Truss Maintenance in Evolving Networks

Truss was proposed to study social network data represented by graphs. A k-truss of a graph is a cohesive subgraph, in which each edge is contained in at least k-2 triangles within the subgraph. While truss has been demonstrated as superior to model the close relationship in social networks and efficient algorithms for finding trusses have been extensively studied, very little attention has been paid to truss maintenance. However, most social networks are evolving networks. It may be infeasible to recompute trusses from scratch from time to time in order to find the up-to-date $k$-trusses in the evolving networks. In this paper, we discuss how to maintain trusses in a graph with dynamic updates. We first discuss a set of properties on maintaining trusses, then propose algorithms on maintaining trusses on edge deletions and insertions, finally, we discuss truss index maintenance. We test the proposed techniques on real datasets. The experiment results show the promise of our work.

cs.DB↗

Quasi-SLCA based Keyword Query Processing over Probabilistic XML Data

The probabilistic threshold query is one of the most common queries in uncertain databases, where a result satisfying the query must be also with probability meeting the threshold requirement. In this paper, we investigate probabilistic threshold keyword queries (PrTKQ) over XML data, which is not studied before. We first introduce the notion of quasi-SLCA and use it to represent results for a PrTKQ with the consideration of possible world semantics. Then we design a probabilistic inverted (PI) index that can be used to quickly return the qualified answers and filter out the unqualified ones based on our proposed lower/upper bounds. After that, we propose two efficient and comparable algorithms: Baseline Algorithm and PI index-based Algorithm. To accelerate the performance of algorithms, we also utilize probability density function. An empirical study using real and synthetic data sets has verified the effectiveness and the efficiency of our approaches.

cs.DB↗

Query-driven Frequent Co-occurring Term Extraction over Relational Data using MapReduce

In this paper we study how to efficiently compute \textit{frequent co-occurring terms} (FCT) in the results of a keyword query in parallel using the popular MapReduce framework. Taking as input a keyword query q and an integer k, an FCT query reports the k terms that are not in q, but appear most frequently in the results of the keyword query q over multiple joined relations. The returned terms of FCT search can be used to do query expansion and query refinement for traditional keyword search. Different from the method of FCT search in a single platform, our proposed approach can efficiently answer a FCT query using the MapReduce Paradigm without pre-computing the results of the original keyword query, which is run in parallel platform. In this work, we can output the final FCT search results by two MapReduce jobs: the first is to extract the statistical information of the data; and the second is to calculate the total frequency of each term based on the output of the first job. At the two MapReduce jobs, we would guarantee the load balance of mappers and the computational balance of reducers as much as possible. Analytical and experimental evaluations demonstrate the efficiency and scalability of our proposed approach using TPC-H benchmark datasets with different sizes.

cs.DB↗

ELCA Evaluation for Keyword Search on Probabilistic XML Data

As probabilistic data management is becoming one of the main research focuses and keyword search is turning into a more popular query means, it is natural to think how to support keyword queries on probabilistic XML data. With regards to keyword query on deterministic XML documents, ELCA (Exclusive Lowest Common Ancestor) semantics allows more relevant fragments rooted at the ELCAs to appear as results and is more popular compared with other keyword query result semantics (such as SLCAs). In this paper, we investigate how to evaluate ELCA results for keyword queries on probabilistic XML documents. After defining probabilistic ELCA semantics in terms of possible world semantics, we propose an approach to compute ELCA probabilities without generating possible worlds. Then we develop an efficient stack-based algorithm that can find all probabilistic ELCA results and their ELCA probabilities for a given keyword query on a probabilistic XML document. Finally, we experimentally evaluate the proposed ELCA algorithm and compare it with its SLCA counterpart in aspects of result effectiveness, time and space efficiency, and scalability.

cs.DB↗

$B_{s} \to PP $ decays and the NLO contributions in the pQCD Approach

By employing the perturbative QCD(pQCD) factorization approach, we calculated the partial next-to-leading order (NLO) contributions to $B_s \to P P$ decays ($P= π, K, \etap $), coming from the QCD vertex corrections, the quark-loops and the chromo-magnetic penguins. we found numerically that (a) for three measured decays $\bar{B}_s \to K^+ π^-, K^+K^-$ and $π^+π^-$, the consistency between the pQCD predictions and the measured values are improved effectively by the inclusion of the NLO contributions; (b) for $\bar{B}_s \to K^0\etap$ and $K^0π^0$ decays, the NLO enhancements to the branching ratios can be significant, from $\sim 50%$ to 170%, to be tested by the LHC experiments; (c) for the CP-violating asymmetries, the leading order pQCD predictions can also be changed significantly by the inclusion of the NLO contributions; (d) for $\bar{B}_s \to K^+π^-$ decay, the pQCD prediction for the direct CP asymmetry is $\acp^{dir}(\bar{B}_s \to K^+π^-)=0.26\pm 0.06$, which agrees very well with the only measured value available currently.

hep-ph↗