SQL Auditing. Introduction. SQL Auditing. Team i-protect. December 10, Denition
|
|
- Clyde Bailey
- 8 years ago
- Views:
Transcription
1 SQL Auditing Team i-protect December 10, 2009 Introduction We introduce an auditing algorithm for determining whether a database system is adhering to its data disclosure policies [3]. Consider Bob (homeless, diabetic guy) goes through the rehabilitation process (g:1 ). He consented that his information can be used by CAISI for doing population level research. After some time, he started receiving advertisements for over the counter diabetes test. Now, the question arises whether this is a coincidence or his information is leaked by someone at CAISI. He goes back to CAISI and questions their privacy protection policy. How CAISI can satisfy Bob? Currently, CAISI is using two rules while doing population level research. 1. Data used for research are de-identied. 2. If a query returns less than 5 rows, it is not executed. It is obvious, that these two conditions are not sucient enough. For example, a query : select facility from client c, disease d where c.id = d.id and c.age > 90 and d.disease = `diabetic' executed on the database (g:2 ) will return more than 5 rows and does not access any private information. The result (g:2 ) has only one row with shelter A, now it is trivial to identify a person above the age of 90 at shelter A and we now know that he is suering from diabetes. SQL Auditing This work is based on the previous research conducted in this eld [1, 2, 3, 4, 5]. Users formulate audit expressions to specify the (sensitive) data subject to disclosure review. An audit component accepts audit expressions and returns all queries (deemed suspicious) that accessed the specied data during their execution [6]. Denition Indispensable tuple: A tuple is indispensable in the computation of a query Q, if its omission makes a dierence. 1
2 Figure 1: Story of homeless, diabetic Bob. Figure 2: Database with tables disease and client. A query executed on this database and obtained results. 2
3 Candidate Query: A query Q is a candidate query w.r.t an audit expression A, if and only if C(Q) C(A) where, C is the column. The correctness of this denition comes from the following argument. Suppose, that a query Q and audit expression A do not share a column. Then, by removing all the columns belonging to A from the database table will not eect the result of query Q. Therefore, for a query Q to be termed as candidate it has to share some column with audit expression A. Suspicious Query: A candidate query Q is suspicious w.r.t audit expression A if they share an indispensable I maximal virtual tuple v. S(Q, A) v τ s.t. I(v, Q) I(v, A) where, τ = T 1 T 2... T n is the cross product of common tables in Q and A. The correctness of this denition is clear from the following argument. Suppose, that the candidate query Q and audit expression A does not share any indispensable tuple. Then there can be only two possibilities. 1) They do not share any tuple, in that case even if we remove all the tuples belonging to A from database, result of Q will not change. 2) They share dispensable tuples, in this case also, upon removing all the tuples belonging to A from database, result of Q will not change. Therefore, for a candidate queryq to be termed as suspicious it has to share indispensable tuple with A. Algorithm 1. Create an audit expression of the form: audit column from table where condition. 2. Find candidate queries with respect to audit expression. 3. From the set of candidate queries nd suspicious queries with respect to audit expression. Discussion SQL auditing algorithm helps in identifying suspicious queries in a given query log. Then by running these suspicious queries one can easily nd whether the database is adhering to its data disclosure policies or not. Continuing with the example of Bob presented in the introduction, we can create an audit expression and test whether the any of the queries present in the query log are suspicious or not (g:3 ). 3
4 Figure 3: Results obtained after running SQL auditing algorithm. Query 1 and 3 are found to be candidate queries. Query 1 is then found to be suspicious. Usage The application is written in java. It is only a prototype without any user interface. File auditing/querylog consists of all the SQL queries. auditing/disease and auditing/client are the les (csv) with database table information. The audit expression is given as input argument. On command line execute the following command with audit expression. java -jar auditing.jar "audit expression" For example, java -jar auditing.jar "audit client.facility from client where client.age>90" References [1] N. Adam and J. Wortman. Security-control methods for statistical databases. ACM Computing Surveys, 21(4):515556, Dec [2] R. Agrawal, J. Kiernan, R. Srikant, and Y. Xu. Hippocratic databases. In 28th Int'l Conference on Very Large Databases, Hong Kong, China, August [3] R. Agrawal, R. Bayardo, C. Faloutsos, J. Kiernan, R. Rantzau, and R. Srikant. Auditing compliance with a hippocratic database. In Proc. of the Intl. Conf. on Very Large Data Bases, Sept
5 [4] R. Motwani, S. U. Nabar, and D. Thomas. Auditing sql queries. In ICDE Workshop on Privacy Data Management, [5] G. Miklau and D. Suciu. A formal analysis of information disclosure in data exchange. In SIGMOD, [6] R. Ramakrishnan and J. Gehrke. Database ManagementSystems. McGraw- Hill,
Enabling the 21st Century HEALTH CARE INFORMATION TECHNOLOGY REVOLUTION
Enabling the 21st Century HEALTH CARE INFORMATION TECHNOLOGY REVOLUTION The U.S. government s vision of the health care information infrastructure is possible using technologies that support the sharing
More informationMining an Online Auctions Data Warehouse
Proceedings of MASPLAS'02 The Mid-Atlantic Student Workshop on Programming Languages and Systems Pace University, April 19, 2002 Mining an Online Auctions Data Warehouse David Ulmer Under the guidance
More informationMining Association Rules: A Database Perspective
IJCSNS International Journal of Computer Science and Network Security, VOL.8 No.12, December 2008 69 Mining Association Rules: A Database Perspective Dr. Abdallah Alashqur Faculty of Information Technology
More informationPrivacy Preserving Data Integration and Sharing
Privacy Preserving Data Integration and Sharing Chris Clifton AnHai Doan Ahmed Elmagarmid Murat Kantarcioglu Gunther Schadow Dan Suciu Jaideep Vaidya The goal of this paper is to identify potential research
More informationEfficient Auditing For Complex SQL queries
Efficient Auditing For Complex SQL queries Raghav Kaushik Microsoft Research skaushi@microsoft.com Ravi Ramamurthy Microsoft Research ravirama@microsoft.com ABSTRACT We address the problem of data auditing
More informationEfficient Integration of Data Mining Techniques in Database Management Systems
Efficient Integration of Data Mining Techniques in Database Management Systems Fadila Bentayeb Jérôme Darmont Cédric Udréa ERIC, University of Lyon 2 5 avenue Pierre Mendès-France 69676 Bron Cedex France
More informationSafeguarding Personal Data using Rights Management in Distributed Applications
Safeguarding Personal Data using Rights Management in Distributed Applications Adolf Hohl 1 and Alf Zugenmaier 2 1 University of Freiburg, adolf.hohl@iig.uni-freiburg.de, 2 DoCoMo Euro-Labs, zugenmaier@docomolab-euro.com
More informationCloud and Big Data Summer School, Stockholm, Aug. 2015 Jeffrey D. Ullman
Cloud and Big Data Summer School, Stockholm, Aug. 2015 Jeffrey D. Ullman 2 In a DBMS, input is under the control of the programming staff. SQL INSERT commands or bulk loaders. Stream management is important
More informationHorizontal Aggregations in SQL to Prepare Data Sets for Data Mining Analysis
IOSR Journal of Computer Engineering (IOSRJCE) ISSN: 2278-0661, ISBN: 2278-8727 Volume 6, Issue 5 (Nov. - Dec. 2012), PP 36-41 Horizontal Aggregations in SQL to Prepare Data Sets for Data Mining Analysis
More informationPreparing Data Sets for the Data Mining Analysis using the Most Efficient Horizontal Aggregation Method in SQL
Preparing Data Sets for the Data Mining Analysis using the Most Efficient Horizontal Aggregation Method in SQL Jasna S MTech Student TKM College of engineering Kollam Manu J Pillai Assistant Professor
More informationMining various patterns in sequential data in an SQL-like manner *
Mining various patterns in sequential data in an SQL-like manner * Marek Wojciechowski Poznan University of Technology, Institute of Computing Science, ul. Piotrowo 3a, 60-965 Poznan, Poland Marek.Wojciechowski@cs.put.poznan.pl
More informationProviding database encryption as a scalable enterprise infrastructure service
Data Mining VI 371 Providing database encryption as a scalable enterprise infrastructure service U. T. Mattsson Protegrity Corp. Abstract As databases become networked in more complex multi-tiered applications,
More informationExplaining Accesses to Electronic Health Records
Explaining Accesses to Electronic Health Records Daniel Fabbri, Kristen LeFevre and David A. Hanauer {dfabbri, klefevre, hanauer}@umich.edu Electrical Engineering & Computer Science, University of Michigan,
More informationDatabase Security & Cryptography
NATIONAL TECHNICAL UNIVERSITY OF ATHENS SCHOOL OF ELECTRICAL AND COMPUTER ENGINEERING Database Security & Cryptography Ζ ή Παρασκευοπού ου 03108152 zoe.paraskevopoulou@gmail.com Νίκος Γιανναράκης 03108054
More informationProc. of the 3rd Intl. Conf. on Document Analysis and Recognition, Montreal, Canada, August 1995. 1
Proc. of the 3rd Intl. Conf. on Document Analysis and Recognition, Montreal, Canada, August 1995. 1 A Map Acquisition, Storage, Indexing, and Retrieval System Hanan Samet Aya Soer Computer Science Department
More informationLecture #11 Relational Database Systems KTH ROYAL INSTITUTE OF TECHNOLOGY
Lecture #11 Relational Database Systems KTH ROYAL INSTITUTE OF TECHNOLOGY Contents Storing data Relational Database Systems Entity Relationship diagrams Normalisation of ER diagrams Tuple Relational Calculus
More informationACTA UNIVERSITATIS APULENSIS No 15/2008 A COMPARISON BETWEEN LOCAL AND GLOBAL RECODING ALGORITHMS FOR ACHIEVING MICRODATA P-SENSITIVE K -ANONYMITY
ACTA UNIVERSITATIS APULENSIS No 15/2008 A COMPARISON BETWEEN LOCAL AND GLOBAL RECODING ALGORITHMS FOR ACHIEVING MICRODATA P-SENSITIVE K -ANONYMITY Traian Marius Truta, Alina Campan, Michael Abrinica, John
More informationIntegrating Pattern Mining in Relational Databases
Integrating Pattern Mining in Relational Databases Toon Calders, Bart Goethals, and Adriana Prado University of Antwerp, Belgium {toon.calders, bart.goethals, adriana.prado}@ua.ac.be Abstract. Almost a
More informationA DATABASE ENCRYPTION SOLUTION THAT IS PROTECTING AGAINST EXTERNAL AND INTERNAL THREATS, AND MEETING REGULATORY REQUIREMENTS
A DATABASE ENCRYPTION SOLUTION THAT IS PROTECTING AGAINST EXTERNAL AND INTERNAL THREATS, AND MEETING REGULATORY REQUIREMENTS A practical implementation of field level privacy Keywords: Isolation, Intrusion
More informationInformation Security in Big Data using Encryption and Decryption
International Research Journal of Computer Science (IRJCS) ISSN: 2393-9842 Information Security in Big Data using Encryption and Decryption SHASHANK -PG Student II year MCA S.K.Saravanan, Assistant Professor
More informationCREATING MINIMIZED DATA SETS BY USING HORIZONTAL AGGREGATIONS IN SQL FOR DATA MINING ANALYSIS
CREATING MINIMIZED DATA SETS BY USING HORIZONTAL AGGREGATIONS IN SQL FOR DATA MINING ANALYSIS Subbarao Jasti #1, Dr.D.Vasumathi *2 1 Student & Department of CS & JNTU, AP, India 2 Professor & Department
More informationInternational Journal of Advanced Research in Computer Science and Software Engineering
Volume, Issue, March 201 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com An Efficient Approach
More informationDesigning A Secure Index For An En encrypted Database
Designing Secure Indexes for Encrypted Databases Erez Shmueli 1, Ronen Waisenberg 1, Yuval Elovici 1, and Ehud Gudes 2 1 Ben-Gurion University of the Negev, Faculty of Engineering, Department of Information
More informationSecurity and Authorization. Introduction to DB Security. Access Controls. Chapter 21
Security and Authorization Chapter 21 Database Management Systems, 3ed, R. Ramakrishnan and J. Gehrke 1 Introduction to DB Security Secrecy: Users should not be able to see things they are not supposed
More informationINFO/CS 330: Applied Database Systems
INFO/CS 330: Applied Database Systems Introduction to Database Security Johannes Gehrke johannes@cs.cornell.edu http://www.cs.cornell.edu/johannes Introduction to DB Security Secrecy:Users should not be
More informationA conceptual framework for Information Security and Privacy
A conceptual framework for Information Security and Privacy GEOFF SKINNER, SONG HAN, and ELIZABETH CHANG Centre for Extended Enterprises and Business Intelligence Curtin University of Technology Perth,
More informationRelational model. Relational model - practice. Relational Database Definitions 9/27/11. Relational model. Relational Database: Terminology
COS 597A: Principles of Database and Information Systems elational model elational model A formal (mathematical) model to represent objects (data/information), relationships between objects Constraints
More informationEfficiently Identifying Inclusion Dependencies in RDBMS
Efficiently Identifying Inclusion Dependencies in RDBMS Jana Bauckmann Department for Computer Science, Humboldt-Universität zu Berlin Rudower Chaussee 25, 12489 Berlin, Germany bauckmann@informatik.hu-berlin.de
More informationDatabase security. André Zúquete Security 1. Advantages of using databases. Shared access Many users use one common, centralized data set
Database security André Zúquete Security 1 Advantages of using databases Shared access Many users use one common, centralized data set Minimal redundancy Individual users do not have to collect and maintain
More informationBEST PRACTICE FOR DATABASE ENCRYPTION SOLUTIONS
BEST PRACTICE FOR DATABASE ENCRYPTION SOLUTIONS INTRODUCTION can provide strong security for data at rest, but developing a database encryption strategy must take many factors into consideration. Organizations
More informationAdina Crainiceanu. Ph.D. in Computer Science, Cornell University, Ithaca, NY May 2006 Thesis Title: Answering Complex Queries in Peer-to-Peer Systems
Adina Crainiceanu Associate Professor Department of Computer Science United States Naval Academy 572M Holloway Road, Stop 9F Annapolis, MD 21402 http://www.usna.edu/users/cs/adina Email: adina@usna.edu
More informationRelational Database: Additional Operations on Relations; SQL
Relational Database: Additional Operations on Relations; SQL Greg Plaxton Theory in Programming Practice, Fall 2005 Department of Computer Science University of Texas at Austin Overview The course packet
More informationSecure Similarity Search on Outsourced Metric Data
International Journal of Computer Trends and Technology (IJCTT) volume 6 number 5 Dec 213 Secure Similarity Search on Outsourced Metric Data P.Maruthi Rao 1, M.Gayatri 2 1 (M.Tech Scholar,Department of
More informationInternational Journal of World Research, Vol: I Issue XIII, December 2008, Print ISSN: 2347-937X DATA MINING TECHNIQUES AND STOCK MARKET
DATA MINING TECHNIQUES AND STOCK MARKET Mr. Rahul Thakkar, Lecturer and HOD, Naran Lala College of Professional & Applied Sciences, Navsari ABSTRACT Without trading in a stock market we can t understand
More informationChina Hanking Holdings Limited Shareholders Communication Policy
China Hanking Holdings Limited Shareholders Communication Policy 1. Purpose 1.1 This Policy aims to set out the provisions with the objective of ensuring that the Company s Shareholders and, in appropriate
More informationMapReduce With Columnar Storage
SEMINAR: COLUMNAR DATABASES 1 MapReduce With Columnar Storage Peitsa Lähteenmäki Abstract The MapReduce programming paradigm has achieved more popularity over the last few years as an option to distributed
More informationThe Relational Model. Why Study the Relational Model? Relational Database: Definitions
The Relational Model Database Management Systems, R. Ramakrishnan and J. Gehrke 1 Why Study the Relational Model? Most widely used model. Vendors: IBM, Microsoft, Oracle, Sybase, etc. Legacy systems in
More informationA Bayesian Approach for on-line max auditing of Dynamic Statistical Databases
A Bayesian Approach for on-line max auditing of Dynamic Statistical Databases Gerardo Canfora Bice Cavallo University of Sannio, Benevento, Italy, {gerardo.canfora,bice.cavallo}@unisannio.it ABSTRACT In
More informationThe process of database development. Logical model: relational DBMS. Relation
The process of database development Reality (Universe of Discourse) Relational Databases and SQL Basic Concepts The 3rd normal form Structured Query Language (SQL) Conceptual model (e.g. Entity-Relationship
More informationMcAfee Web Reporter Turning volumes of data into actionable intelligence
McAfee Web Reporter Turning volumes of data into actionable intelligence Business today is more Internet-dependent than ever before. From missioncritical services to productivity tools, Internet access
More informationUsing Data Mining Methods to Predict Personally Identifiable Information in Emails
Using Data Mining Methods to Predict Personally Identifiable Information in Emails Liqiang Geng 1, Larry Korba 1, Xin Wang, Yunli Wang 1, Hongyu Liu 1, Yonghua You 1 1 Institute of Information Technology,
More informationtypes, but key declarations and constraints Similar CREATE X commands for other schema ëdrop X name" deletes the created element of beer VARCHARè20è,
Dening a Database Schema CREATE TABLE name èlist of elementsè. Principal elements are attributes and their types, but key declarations and constraints also appear. Similar CREATE X commands for other schema
More informationTowards a Hippocratic Log File Architecture
Towards a Hippocratic Log File Architecture ANDREW RUTHERFORD AND REINHARDT BOTHA Port Elizabeth Technikon and MARTIN OLIVIER University of Pretoria The World Wide Web (WWW) is fast becoming the central
More informationA Way to Understand Various Patterns of Data Mining Techniques for Selected Domains
A Way to Understand Various Patterns of Data Mining Techniques for Selected Domains Dr. Kanak Saxena Professor & Head, Computer Application SATI, Vidisha, kanak.saxena@gmail.com D.S. Rajpoot Registrar,
More informationCSE 530A Database Management Systems. Introduction. Washington University Fall 2013
CSE 530A Database Management Systems Introduction Washington University Fall 2013 Overview Time: Mon/Wed 7:00-8:30 PM Location: Crow 206 Instructor: Michael Plezbert TA: Gene Lee Websites: http://classes.engineering.wustl.edu/cse530/
More informationHorizontal Aggregations In SQL To Generate Data Sets For Data Mining Analysis In An Optimized Manner
24 Horizontal Aggregations In SQL To Generate Data Sets For Data Mining Analysis In An Optimized Manner Rekha S. Nyaykhor M. Tech, Dept. Of CSE, Priyadarshini Bhagwati College of Engineering, Nagpur, India
More informationStatic Data Mining Algorithm with Progressive Approach for Mining Knowledge
Global Journal of Business Management and Information Technology. Volume 1, Number 2 (2011), pp. 85-93 Research India Publications http://www.ripublication.com Static Data Mining Algorithm with Progressive
More informationDatabase Encryption - How to Balance Security with Performance
Database Encryption - How to Balance Security with Performance Ulf T. Mattsson Protegrity Corp. Abstract Encryption can provide strong security for data at rest, but developing a database encryption strategy
More informationWEB IMAGE INFORMATION MINING SYSTEM USING UUP FOR E-BUSINESS INTELLIGENCE
WEB IMAGE INFORMATION MINING SYSTEM USING UUP FOR E-BUSINESS INTELLIGENCE Seong-Yong Hong, Korea Advanced Institute of Science and Technology (KAIST), gosyhong@kaist.ac.kr ABSTRACT Recently, the web sites
More informationA Model For Revelation Of Data Leakage In Data Distribution
A Model For Revelation Of Data Leakage In Data Distribution Saranya.R Assistant Professor, Department Of Computer Science and Engineering Lord Jegannath college of Engineering and Technology Nagercoil,
More informationPrivacy-Preserving Data Integration and Sharing
Privacy-Preserving Integration and Sharing Chris Clifton Purdue University clifton@cs.purdue.edu Murat Kantarcıoǧlu Purdue University kanmurat@cs.purdue.edu AnHai Doan University of Illinois anhai@cs.uiuc.edu
More informationIntelligent Stock Market Assistant using Temporal Data Mining
Intelligent Stock Market Assistant using Temporal Data Mining Gerasimos Marketos 1, Konstantinos Pediaditakis 2, Yannis Theodoridis 1, and Babis Theodoulidis 2 1 Database Group, Information Systems Laboratory,
More informationPhysical Database Design Process. Physical Database Design Process. Major Inputs to Physical Database. Components of Physical Database Design
Physical Database Design Process Physical Database Design Process The last stage of the database design process. A process of mapping the logical database structure developed in previous stages into internal
More informationTOWARDS HIPPOCRATIC LOG FILES
TOWARDS HIPPOCRATIC LOG FILES Andrew Rutherford 1, Reinhardt Botha 2 and Martin Olivier 3 1,2 Department of Business Information Systems, Port Elizabeth Technikon, South Africa 3 Department of Computer
More informationPrivacy Preserved Association Rule Mining For Attack Detection and Prevention
Privacy Preserved Association Rule Mining For Attack Detection and Prevention V.Ragunath 1, C.R.Dhivya 2 P.G Scholar, Department of Computer Science and Engineering, Nandha College of Technology, Erode,
More informationACCELERATING SELECT WHERE AND SELECT JOIN QUERIES ON A GPU
Computer Science 14 (2) 2013 http://dx.doi.org/10.7494/csci.2013.14.2.243 Marcin Pietroń Pawe l Russek Kazimierz Wiatr ACCELERATING SELECT WHERE AND SELECT JOIN QUERIES ON A GPU Abstract This paper presents
More informationMultiAlign Software. Windows GUI. Console Application. MultiAlign Software Website. Test Data
MultiAlign Software This documentation describes MultiAlign and its features. This serves as a quick guide for starting to use MultiAlign. MultiAlign comes in two forms: as a graphical user interface (GUI)
More informationIncSpan: Incremental Mining of Sequential Patterns in Large Database
IncSpan: Incremental Mining of Sequential Patterns in Large Database Hong Cheng Department of Computer Science University of Illinois at Urbana-Champaign Urbana, Illinois 61801 hcheng3@uiuc.edu Xifeng
More informationPREDICTIVE MODELING OF INTER-TRANSACTION ASSOCIATION RULES A BUSINESS PERSPECTIVE
International Journal of Computer Science and Applications, Vol. 5, No. 4, pp 57-69, 2008 Technomathematics Research Foundation PREDICTIVE MODELING OF INTER-TRANSACTION ASSOCIATION RULES A BUSINESS PERSPECTIVE
More informationNEW TECHNIQUE TO DEAL WITH DYNAMIC DATA MINING IN THE DATABASE
www.arpapress.com/volumes/vol13issue3/ijrras_13_3_18.pdf NEW TECHNIQUE TO DEAL WITH DYNAMIC DATA MINING IN THE DATABASE Hebah H. O. Nasereddin Middle East University, P.O. Box: 144378, Code 11814, Amman-Jordan
More informationActivity Mining for Discovering Software Process Models
Activity Mining for Discovering Software Process Models Ekkart Kindler, Vladimir Rubin, Wilhelm Schäfer Software Engineering Group, University of Paderborn, Germany [kindler, vroubine, wilhelm]@uni-paderborn.de
More informationEmpirically Identifying the Best Genetic Algorithm for Covering Array Generation
Empirically Identifying the Best Genetic Algorithm for Covering Array Generation Liang Yalan 1, Changhai Nie 1, Jonathan M. Kauffman 2, Gregory M. Kapfhammer 2, Hareton Leung 3 1 Department of Computer
More informationRDB-MINER: A SQL-Based Algorithm for Mining True Relational Databases
998 JOURNAL OF SOFTWARE, VOL. 5, NO. 9, SEPTEMBER 2010 RDB-MINER: A SQL-Based Algorithm for Mining True Relational Databases Abdallah Alashqur Faculty of Information Technology Applied Science University
More informationSecure and Faster NN Queries on Outsourced Metric Data Assets Renuka Bandi #1, Madhu Babu Ch *2
Secure and Faster NN Queries on Outsourced Metric Data Assets Renuka Bandi #1, Madhu Babu Ch *2 #1 M.Tech, CSE, BVRIT, Hyderabad, Andhra Pradesh, India # Professor, Department of CSE, BVRIT, Hyderabad,
More informationEventifier: Extracting Process Execution Logs from Operational Databases
Eventifier: Extracting Process Execution Logs from Operational Databases Carlos Rodríguez 1, Robert Engel 2, Galena Kostoska 1, Florian Daniel 1, Fabio Casati 1, and Marco Aimar 3 1 University of Trento,
More informationEfficient Algorithms for Masking and Finding Quasi-Identifiers
Efficient Algorithms for Masking and Finding Quasi-Identifiers Rajeev Motwani Stanford University rajeev@cs.stanford.edu Ying Xu Stanford University xuying@cs.stanford.edu ABSTRACT A quasi-identifier refers
More informationData Mining and Sensitive Inferences
Template-Based Privacy Preservation in Classification Problems Ke Wang Simon Fraser University BC, Canada V5A S6 wangk@cs.sfu.ca Benjamin C. M. Fung Simon Fraser University BC, Canada V5A S6 bfung@cs.sfu.ca
More informationDatabase Systems Introduction Dr P Sreenivasa Kumar
Database Systems Introduction Dr P Sreenivasa Kumar Professor CS&E Department I I T Madras 1 Introduction What is a Database? A collection of related pieces of data: Representing/capturing the information
More informationSPMF: a Java Open-Source Pattern Mining Library
Journal of Machine Learning Research 1 (2014) 1-5 Submitted 4/12; Published 10/14 SPMF: a Java Open-Source Pattern Mining Library Philippe Fournier-Viger philippe.fournier-viger@umoncton.ca Department
More informationSchema Design and Normal Forms Sid Name Level Rating Wage Hours
Entity-Relationship Diagram Schema Design and Sid Name Level Rating Wage Hours Database Management Systems, 2 nd Edition. R. Ramakrishnan and J. Gehrke 1 Database Management Systems, 2 nd Edition. R. Ramakrishnan
More informationIn-Memory Columnar Databases HyPer. Arto Kärki University of Helsinki 30.11.2012
In-Memory Columnar Databases HyPer Arto Kärki University of Helsinki 30.11.2012 1 Introduction Columnar Databases Design Choices Data Clustering and Compression Conclusion 2 Introduction The relational
More informationPortable Bushy Processing Trees for Join Queries
Reihe Informatik 11 / 1996 Constructing Optimal Bushy Processing Trees for Join Queries is NP-hard Wolfgang Scheufele Guido Moerkotte 1 Constructing Optimal Bushy Processing Trees for Join Queries is NP-hard
More informationPBKM: A Secure Knowledge Management Framework
PBKM: A Secure Knowledge Management Framework (extended abstract) Shouhuai Xu and Weining Zhang Department of Computer Science, University of Texas at San Antonio {shxu,wzhang}@cs.utsa.edu Abstract In
More informationInfrastructures for big data
Infrastructures for big data Rasmus Pagh 1 Today s lecture Three technologies for handling big data: MapReduce (Hadoop) BigTable (and descendants) Data stream algorithms Alternatives to (some uses of)
More informationComputing Range Queries on Obfuscated Data
Computing Range Queries on Obfuscated Data E. Damiani 1 S. De Capitani di Vimercati 1 S. Paraboschi 2 P. Samarati 1 (1) Dip. di Tecnologie dell Infomazione (2) Dip. di Ing. Gestionale e dell Informazione
More informationData Mining and Database Systems: Where is the Intersection?
Data Mining and Database Systems: Where is the Intersection? Surajit Chaudhuri Microsoft Research Email: surajitc@microsoft.com 1 Introduction The promise of decision support systems is to exploit enterprise
More informationCardinality-based Inference Control in Sum-only Data Cubes (Extended Version)
Cardinality-based Inference Control in Sum-only Data Cubes (Extended Version) Lingyu Wang, Duminda Wijesekera, and Sushil Jajodia Center for Secure Information Systems George Mason University, Fairfax,
More informationOverview of Storage and Indexing. Data on External Storage. Alternative File Organizations. Chapter 8
Overview of Storage and Indexing Chapter 8 How index-learning turns no student pale Yet holds the eel of science by the tail. -- Alexander Pope (1688-1744) Database Management Systems 3ed, R. Ramakrishnan
More informationThe Relational Model. Why Study the Relational Model? Relational Database: Definitions. Chapter 3
The Relational Model Chapter 3 Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke 1 Why Study the Relational Model? Most widely used model. Vendors: IBM, Informix, Microsoft, Oracle, Sybase,
More informationData attribute security and privacy in distributed database system
IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661, p- ISSN: 2278-8727Volume 16, Issue 2, Ver. V (Mar-Apr. 2014), PP 27-33 Data attribute security and privacy in distributed database system
More informationComputer Security (EDA263 / DIT 641)
Computer Security (EDA263 / DIT 641) Lecture 12: Database Security Erland Jonsson Department of Computer Science and Engineering Chalmers University of Technology Sweden Outline Introduction to databases
More informationPatient-Centric Secure-and-Privacy-Preserving Service-Oriented Architecture for Health Information Integration and Exchange
Patient-Centric Secure-and-Privacy-Preserving Service-Oriented Architecture for Health Information Integration and Exchange Mahmoud Awad and Larry Kerschberg, Center for Health Information Technology,
More informationDEVELOPMENT OF HASH TABLE BASED WEB-READY DATA MINING ENGINE
DEVELOPMENT OF HASH TABLE BASED WEB-READY DATA MINING ENGINE SK MD OBAIDULLAH Department of Computer Science & Engineering, Aliah University, Saltlake, Sector-V, Kol-900091, West Bengal, India sk.obaidullah@gmail.com
More informationSQL: Queries, Programming, Triggers
SQL: Queries, Programming, Triggers Chapter 5 Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke 1 R1 Example Instances We will use these instances of the Sailors and Reserves relations in
More informationCurrent Developments of k-anonymous Data Releasing
Current Developments of k-anonymous Data Releasing Jiuyong Li 1 Hua Wang 1 Huidong Jin 2 Jianming Yong 3 Abstract Disclosure-control is a traditional statistical methodology for protecting privacy when
More informationThesis work and research project
Thesis work and research project Hélia Pouyllau, INRIA of Rennes, Campus Beaulieu 35042 Rennes, helia.pouyllau@irisa.fr July 16, 2007 1 Thesis work on Distributed algorithms for endto-end QoS contract
More informationDepartment of Computer and Information Science, Ohio State University. In Section 3, the concepts and structure of signature
Proceedings of the 2nd International Computer Science Conference, Hong Kong, Dec. 1992, 616-622. 616 SIGNATURE FILE METHODS FOR INDEXING OBJECT-ORIENTED DATABASE SYSTEMS Wang-chien Lee and Dik L. Lee Department
More informationExample Instances. SQL: Queries, Programming, Triggers. Conceptual Evaluation Strategy. Basic SQL Query. A Note on Range Variables
SQL: Queries, Programming, Triggers Chapter 5 Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke 1 Example Instances We will use these instances of the Sailors and Reserves relations in our
More informationThe Cost of Privacy: Destruction of Data-Mining Utility in Anonymized Data Publishing
The Cost of Privacy: Destruction of Data-Mining Utility in Anonymized Data Publishing Justin Brickell and Vitaly Shmatikov Department of Computer Sciences The University of Texas at Austin jlbrick@cs.utexas.edu,
More informationTowards Privacy aware Big Data analytics
Towards Privacy aware Big Data analytics Pietro Colombo, Barbara Carminati, and Elena Ferrari Department of Theoretical and Applied Sciences, University of Insubria, Via Mazzini 5, 21100 - Varese, Italy
More informationCA Workload Automation Agent for Databases
CA Workload Automation Agent for Databases Implementation Guide r11.3.4 This Documentation, which includes embedded help systems and electronically distributed materials, (hereinafter referred to as the
More informationProposing a Novel Synergized K-Degree L-Diversity T- Closeness Model for Graph Based Data Anonymization
Proposing a Novel Synergized K-Degree L-Diversity T- Closeness Model for Graph Based Data Anonymization S.Charanyaa 1, K.Sangeetha 2 M.Tech. Student, Dept of Information Technology, S.N.S. College of Technology,
More informationShareholders Communication Policy
Shareholders Communication Policy China Resources Power Holdings Company Limited Adopted By the Board: 19 March 2012 Room 2001-05, 20/F, China Resources Building 26 Harbour Road, Wanchai, Hong Kong www.cr
More informationOverview of Scalable Distributed Database System SD-SQL Server
Overview of Scalable Distributed Database System Server Witold Litwin 1, Soror Sahri 2, Thomas Schwarz 3 CERIA, Paris-Dauphine University 75016 Paris, France Abstract. We present a scalable distributed
More informationUnraveling the Duplicate-Elimination Problem in XML-to-SQL Query Translation
Unraveling the Duplicate-Elimination Problem in XML-to-SQL Query Translation Rajasekar Krishnamurthy University of Wisconsin sekar@cs.wisc.edu Raghav Kaushik Microsoft Corporation skaushi@microsoft.com
More informationExtend Table Lens for High-Dimensional Data Visualization and Classification Mining
Extend Table Lens for High-Dimensional Data Visualization and Classification Mining CPSC 533c, Information Visualization Course Project, Term 2 2003 Fengdong Du fdu@cs.ubc.ca University of British Columbia
More informationSpatial Data Handling in PostGIS DOROTHEA ANDERSSON
Spatial Data Handling in PostGIS DOROTHEA ANDERSSON Bachelor of Science Thesis Stockholm, Sweden 2012 Spatial Data Handling in PostGIS DOROTHEA ANDERSSON DD143X, Bachelor s Thesis in Computer Science (15
More information5 Simple Steps to Secure Database Development
E-Guide 5 Simple Steps to Secure Database Development Databases and the information they hold are always an attractive target for hackers looking to exploit weaknesses in database applications. This expert
More informationComputer Science in Education
www.ijcsi.org 290 Computer Science in Education Irshad Ullah Institute, Computer Science, GHSS Ouch Khyber Pakhtunkhwa, Chinarkot, ISO 2-alpha PK, Pakistan Abstract Computer science or computing science
More informationEVALUATION BY PARTS OF TRUSTED. Ravi S. Sandhu. George Mason University, Fairfax, VA 22030-4444
Proc. 4th RADC Workshop on Multilevel Database Security, Rhode Island, April 1991, pages 122-126. EVALUATION BY PARTS OF TRUSTED DATABASE MANAGEMENT SYSTEMS Ravi S. Sandhu Center for Secure Information
More information