Titlebook: Database Systems for Advanced Applications; 19th International C Sourav S. Bhowmick,Curtis E. Dyreson,Bernhard Thal Conference proceedings

TAIN

Selectivity Estimation of Reverse ,-Nearest Neighbor Queriesr of results for a given R.NN query, providing a key ingredient of common (relational) query optimizers. A range of experiments evaluate the quality of these estimates compared to the true number of results on both real and synthetic data, analyzing the potentials of the proposed approximations to m

Guileless

Efficient Sampling Methods for Shortest Path Query over Uncertain Graphsompleteness in data collection. This is why uncertain graphs catch much attention of researchers. However, the uncertain graph models in existing works assume all edges in a graph are independent of each other, which dose not really make sense in real applications. Thus, we propose a new model for u

escalate

Exploiting Transitive Similarity and Temporal Dynamics for Similarity Search in Heterogeneous Inform In this paper, we study the problem of similarity search in heterogeneous information networks, and extend the meta path-based similarity measure . by incorporating richer information, such as transitive similarity and temporal dynamics. Experiments on a large DBLP network show that our improved si

obtuse

Top-k Similarity Matching in Large Graphs with Attributesd graph, effective and efficient graph matching methods are critical. However, due to the noisy and the incomplete nature of real graph data, approximate graph matching is essential. On the other hand, most users are only interested in the top-. similar matching, which proposed the problem of top-.

Albinism

On Perspective-Aware Top-, Similarity Search in Multi-relational Networksmmendation, link prediction, and web searching. Existing approaches to this problem do not consider types of relationships (edges) between two nodes. However, in real networks there exist different kinds of relationships. These kinds of network are called multi-relational networks, in which, differe

表主動(dòng)

AVID

Access Control for Data Integration in Presence of Data Dependenciescess control policy and cannot anticipate data inferences that can arise when data is integrated at the mediator level. Inferences, e.g., using functional dependencies, can allow malicious users to obtain, at the mediator level, prohibited information by linking multiple queries and thus violating t

Innocence

Benzodiazepines

Privacy-Preserving Schema Reuseeuse is a methodology that allows users to create new schemas by copying and adapting existing ones. This methodology supports to reduce not only the effort of designing new schemas but also the heterogeneity between them. One of the biggest barriers of schema reuse is about privacy concerns that di

APEX

Any Suggestions? Active Schema Support for Structuring Web Informationa corpus of 733 million Web documents shows that, a year after its introduction, only 1.56% of documents featured any schema.org annotations. A probable reason is that providing annotations is quite tiresome, hindering wide-spread adoption. Here even state-of-the-art tools like Google’s Structured D