找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Database Systems for Advanced Applications; 16th International C Jeffrey Xu Yu,Myoung Ho Kim,Rainer Unland Conference proceedings 2011 Spri

[复制链接]
楼主: 作业
发表于 2025-3-27 00:19:15 | 显示全部楼层
发表于 2025-3-27 01:38:20 | 显示全部楼层
发表于 2025-3-27 07:05:49 | 显示全部楼层
What Have We Learnt from Deductive Object-Oriented Database Research?ursive deductive rules and recursive queries. Moreover, deductive databases have a firm logical foundation that consists of both model-theoretic semantics in terms of the minimal model [3], the stable model [4], and the well-founded model [5], and proof-theoretic semantics in terms of bottom-up fixp
发表于 2025-3-27 13:18:46 | 显示全部楼层
发表于 2025-3-27 13:53:55 | 显示全部楼层
Distributed Privacy Preserving Data Collectionencryption, private information retrieval and secure multiparty computation to ensure the privacy goal in the process of data collection. Meanwhile, the protocol is designed to leak limited but non-critical information to achieve practicability and efficiency. Experiments show that the utility of th
发表于 2025-3-27 19:54:59 | 显示全部楼层
Privacy Preserving Query Processing on Secret Share Based Data Storagex to accelerate query and to help return the exactly required data tuples. Finally we analyze the security properties and demonstrate the efficiency and query response time of our approach through empirical data.
发表于 2025-3-28 00:29:10 | 显示全部楼层
发表于 2025-3-28 02:18:54 | 显示全部楼层
STS: Complex Spatio-Temporal Sequence Mining in Flickrscene, and its difference for different users, as well as the travel time limitation. In this paper, we provide two approximate algorithms: a local optimization algorithm and a global optimization algorithm. Finally, we give an experimental evaluation of the proposed algorithms using real datasets i
发表于 2025-3-28 08:37:59 | 显示全部楼层
Node Protection in Weighted Social Networksps prevent node re-identification in the weighted graph based on three distance functions which measure the nodes’ difference. We also design corresponding algorithms for each distance to achieve anonymity. Some experiments on real datasets show the effectiveness of our methods.
发表于 2025-3-28 13:24:46 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-23 01:04
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表