Proceedings of the 2009 ACM SIGMOD International Conference on Management of data最新文献_第3页

Privacy preservation of aggregates in hidden databases: why and how? 隐藏数据库中聚合的隐私保护:为什么以及如何保护?

Proceedings of the 2009 ACM SIGMOD International Conference on Management of data Pub Date : 2009-06-29 DOI: 10.1145/1559845.1559863

A. Dasgupta, Nan Zhang, Gautam Das, S. Chaudhuri

引用次数: 23

Hermes: a travel through semantics on the data web Hermes:数据网络上的语义之旅

Proceedings of the 2009 ACM SIGMOD International Conference on Management of data Pub Date : 2009-06-29 DOI: 10.1145/1559845.1560002

Haofen Wang, Thomas Penin, Kaifeng Xu, Junquan Chen, Xinruo Sun, L. Fu, Qiaoling Liu, Yong Yu, Thanh Tran, P. Haase, R. Studer

引用次数: 7

Voyagers and voyeurs: supporting social data analysis 旅行者和偷窥者:支持社会数据分析

Proceedings of the 2009 ACM SIGMOD International Conference on Management of data Pub Date : 2009-06-29 DOI: 10.1145/1559845.1559958

Jeffrey Heer

引用次数: 6

Secure kNN computation on encrypted databases 加密数据库上的安全kNN计算

Proceedings of the 2009 ACM SIGMOD International Conference on Management of data Pub Date : 2009-06-29 DOI: 10.1145/1559845.1559862

W. Wong, D. Cheung, B. Kao, N. Mamoulis

{"title":"Secure kNN computation on encrypted databases","authors":"W. Wong, D. Cheung, B. Kao, N. Mamoulis","doi":"10.1145/1559845.1559862","DOIUrl":"https://doi.org/10.1145/1559845.1559862","url":null,"abstract":"Service providers like Google and Amazon are moving into the SaaS (Software as a Service) business. They turn their huge infrastructure into a cloud-computing environment and aggressively recruit businesses to run applications on their platforms. To enforce security and privacy on such a service model, we need to protect the data running on the platform. Unfortunately, traditional encryption methods that aim at providing \"unbreakable\" protection are often not adequate because they do not support the execution of applications such as database queries on the encrypted data. In this paper we discuss the general problem of secure computation on an encrypted database and propose a SCONEDB Secure Computation ON an Encrypted DataBase) model, which captures the execution and security requirements. As a case study, we focus on the problem of k-nearest neighbor (kNN) computation on an encrypted database. We develop a new asymmetric scalar-product-preserving encryption (ASPE) that preserves a special type of scalar product. We use APSE to construct two secure schemes that support kNN computation on encrypted data; each of these schemes is shown to resist practical attacks of a different background knowledge level, at a different overhead cost. Extensive performance studies are carried out to evaluate the overhead and the efficiency of the schemes.","PeriodicalId":344093,"journal":{"name":"Proceedings of the 2009 ACM SIGMOD International Conference on Management of data","volume":"132 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127371134","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 843

Exploring biomedical databases with BioNav 利用BioNav探索生物医学数据库

Proceedings of the 2009 ACM SIGMOD International Conference on Management of data Pub Date : 2009-06-29 DOI: 10.1145/1559845.1559987

Abhijith Kashyap, Vagelis Hristidis, M. Petropoulos, Sotiria Tavoulari

引用次数: 1

MEDIALIFE: from images to a life chronicle MEDIALIFE:从影像到生活编年史

Proceedings of the 2009 ACM SIGMOD International Conference on Management of data Pub Date : 2009-06-29 DOI: 10.1145/1559845.1559998

Amarnath Gupta, S. Rafatirad, Mingyan Gao, R. Jain

引用次数: 4

Augmented social cognition: using social web technology to enhance the ability of groups to remember, think, and reason 增强社会认知:利用社交网络技术增强群体的记忆、思考和推理能力

Proceedings of the 2009 ACM SIGMOD International Conference on Management of data Pub Date : 2009-06-29 DOI: 10.1145/1559845.1559959

Ed H. Chi

{"title":"Augmented social cognition: using social web technology to enhance the ability of groups to remember, think, and reason","authors":"Ed H. Chi","doi":"10.1145/1559845.1559959","DOIUrl":"https://doi.org/10.1145/1559845.1559959","url":null,"abstract":"We are experiencing a new Social Web, where people share, communicate, commiserate, and conflict with each other. As evidenced by systems like Wikipedia, twitter, and delicious.com, these environments are turning people into social information foragers and sharers. Groups interact to resolve conflicts and jointly make sense of topic areas from \"Obama vs. Clinton\" to \"Islam.\" PARC's Augmented Social Cognition researchers -- who come from cognitive psychology, computer science, HCI, CSCW, and other disciplines -- focus on understanding how to \"enhance a group of people's ability to remember, think, and reason\". Through Social Web systems like social bookmarking sites, blogs, Wikis, and more, we can finally study, in detail, these types of enhancements on a very large scale. Here we summarize recent work and early findings such as: (1) how conflict and coordination have played out in Wikipedia, and how social transparency might affect reader trust; (2) how decreasing interaction costs might change participation in social tagging systems; and (3) how computation can help organize user-generated content and metadata.","PeriodicalId":344093,"journal":{"name":"Proceedings of the 2009 ACM SIGMOD International Conference on Management of data","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116585073","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 30

Secure outsourced aggregation via one-way chains 通过单向链保护外包聚合

Proceedings of the 2009 ACM SIGMOD International Conference on Management of data Pub Date : 2009-06-29 DOI: 10.1145/1559845.1559851

Suman Nath, Haifeng Yu, Haowen Chan

引用次数: 52

3-HOP: a high-compression indexing scheme for reachability query 3-HOP:可达性查询的高压缩索引方案

Proceedings of the 2009 ACM SIGMOD International Conference on Management of data Pub Date : 2009-06-29 DOI: 10.1145/1559845.1559930

R. Jin, Yang Xiang, Ning Ruan, David Fuhry

{"title":"3-HOP: a high-compression indexing scheme for reachability query","authors":"R. Jin, Yang Xiang, Ning Ruan, David Fuhry","doi":"10.1145/1559845.1559930","DOIUrl":"https://doi.org/10.1145/1559845.1559930","url":null,"abstract":"Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the complete transitive closure, or utilizes the 2-hop strategy to describe the reachability. Almost all of these approaches work well for very sparse graphs. However, the challenging problem is that as the ratio of the number of edges to the number of vertices increases, the size of the compressed transitive closure grows very large. In this paper, we propose a new 3-hop indexing scheme for directed graphs with higher density. The basic idea of 3-hop indexing is to use chain structures in combination with hops to minimize the number of structures that must be indexed. Technically, our goal is to find a 3-hop scheme over dense DAGs (directed acyclic graphs) with minimum index size. We develop an efficient algorithm to discover a transitive closure contour, which yields near optimal index size. Empirical studies show that our 3-hop scheme has much smaller index size than state-of-the-art reachability query schemes such as 2-hop and path-tree when DAGs are not very sparse, while our query time is close to path-tree, which is considered to be one of the best reachability query schemes.","PeriodicalId":344093,"journal":{"name":"Proceedings of the 2009 ACM SIGMOD International Conference on Management of data","volume":"178 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115178461","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 223

Session details: Research session 18: keyword search 会议详情:研究会议18:关键词搜索

Proceedings of the 2009 ACM SIGMOD International Conference on Management of data Pub Date : 2009-06-29 DOI: 10.1145/3257466

Y. Papakonstantinou

引用次数: 0