ICDE 2009 - PDF Preprint Papers

ICDE 2009 International Conference on Data Engineering

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ICDE-2009 Paper

click to vote

ICDE
2009
IEEE

1081views Database» more ICDE 2009»

Modeling and Integrating Background Knowledge in Data Anonymization

15 years 4 months ago

Download www.cs.purdue.edu

Recent work has shown the importance of considering the adversary’s background knowledge when reasoning about privacy in data publishing. However, it is very difficult for the d...

Tiancheng Li, Ninghui Li, Jian Zhang

posted by tiancheng

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	1081	Modeling and Integrating Background Knowledge in Data Anonymization
2	690	A Model for Data Leakage Detection	claim
3	409	Chameleon: Context Awareness inside DBMSs
4	392	FF-Anonymity: When Quasi-Identifiers Are Missing
5	290	GraphSig: A Scalable Approach to Mining Significant Subgraphs in Large Graph Databases	claim
6	285	Design and Evaluation of the iMed Intelligent Medical Search Engine	claim
7	278	Probabilistic Skyline Operator over Sliding Windows	claim
8	255	Database Management as a Service: Challenges and Opportunities	claim
9	251	Contextual Ranking of Keywords Using Click Data	claim
10	245	WISE: A Workflow Information Search Engine	claim
11	223	Another Outlier Bites the Dust: Computing Meaningful Aggregates in Sensor Networks	claim
12	219	Distance Oracles for Spatial Networks	claim
13	216	Continuous Subgraph Pattern Search over Graph Streams	claim
14	214	Ranking with Uncertain Scores	claim
15	210	Keyword Search in Spatial Databases: Towards Searching by Document	claim
16	205	Top-k Exploration of Query Candidates for Efficient Keyword Search on Graph-Shaped (RDF) Data	claim
17	202	Tracking High Quality Clusters over Uncertain Data Streams	claim
18	200	Adaptive Scheduling of Web Transactions	claim
19	198	Double Index NEsted-Loop Reactive Join for Result Rate Optimization	claim
20	198	V*-kNN: An Efficient Algorithm for Moving k Nearest Neighbor Queries	claim
21	195	The PRISM Workwench: Database Schema Evolution without Tears	claim
22	194	Effective XML Keyword Search with Relevance Oriented Ranking	claim
23	194	Top-k Set Similarity Joins	claim
24	192	Deriving Private Information from Association Rule Mining Results	claim
25	192	Topologically Sorted Skylines for Partially Ordered Domains	claim
26	190	Progressive Keyword Search in Relational Databases	claim
27	188	GuruMine: A Pattern Mining System for Discovering Leaders and Tribes	claim
28	186	A Benchmark for Online Index Selection	claim
29	184	Scalable Keyword Search on Large Data Streams	claim
30	183	Efficient Indices Using Graph Partitioning in RDF Triple Stores	claim
31	183	A Decade of XML Data Management: An Industrial Experience Report from Oracle	claim
32	182	Adaptive Parallelization of Queries over Dependent Web Service Calls	claim
33	182	Environmental Monitoring 2.0	claim
34	181	BP-Wrapper: A System Framework Making Any Replacement Algorithms (Almost) Lock Contention Free	claim
35	180	Reverse Furthest Neighbors in Spatial Databases	claim
36	180	Outsourcing Search Services on Private Spatial Data	claim
37	179	Flexible Recommendations for Course Planning	claim
38	179	Self-Tuning, Bandwidth-Aware Monitoring for Dynamic Data Streams	claim
39	178	Efficient Query Evaluation over Temporally Correlated Probabilistic Streams	claim
40	177	Towards Composition as a Service - A Quality of Service Driven Approach	claim
41	177	Light-Weight, Runtime Verification of Query Sources	claim
42	176	Discovering Conditional Functional Dependencies	claim
43	176	Efficient Table Anonymization for Aggregate Query Answering	claim
44	174	Sketching Sampled Data Streams	claim
45	173	Efficient Processing of Warping Time Series Join of Motion Capture Data	claim
46	173	Differencing Provenance in Scientific Workflows	claim
47	173	Efficient Mining of Closed Repetitive Gapped Subsequences from a Sequence Database	claim
48	171	A Framework for Clustering Massive-Domain Data Streams	claim
49	171	CoTS: A Scalable Framework for Parallelizing Frequency Counting over Data Streams	claim
50	170	Semantics of Ranking Queries for Probabilistic Data and Expected Ranks	claim
51	170	Leveraging COUNT Information in Sampling Hidden Databases	claim
52	170	On High Dimensional Projected Clustering of Uncertain Data Streams	claim
53	169	Visible Reverse k-Nearest Neighbor Queries	claim
54	168	Privacy-Preserving Singular Value Decomposition	claim
55	168	An Economic Model for Self-Tuned Cloud Caching	claim
56	166	Supporting Database Applications as a Service	claim
57	165	Expressive Location-Based Continuous Query Evaluation with Binary Decision Diagrams	claim
58	165	Spatial Range Querying for Gaussian-Based Imprecise Query Objects	claim
59	164	Efficient and Robust Database Support for Data-Intensive Applications in Dynamic Environments	claim
60	163	Distance-Based Representative Skyline	claim
61	163	A Data Structure for Sponsored Search	claim
62	160	MatchUp: Autocompletion for Mashups	claim
63	160	AJAX Crawl: Making AJAX Applications Searchable	claim
64	160	Perm: Processing Provenance and Data on the Same Data Model through Query Rewriting	claim
65	159	Sketch-Based Summarization of Ordered XML Streams	claim
66	159	ApproxRank: Estimating Rank for a Subgraph	claim
67	159	Efficient Private Record Linkage	claim
68	158	KSpot: Effectively Monitoring the K Most Important Events in a Wireless Sensor Network	claim
69	158	An Integrated Approach to Performance Monitoring for Autonomous Tuning	claim
70	158	BioNav: Effective Navigation on Query Results of Biomedical Databases	claim
71	157	A Rule-Based Classification Algorithm for Uncertain Data	claim
72	157	Confidence-Aware Join Algorithms	claim
73	157	Clustering Uncertain Data with Possible Worlds	claim
74	157	Query Rewrites with Views for XML in DB2	claim
75	156	Distributed Structural Relaxation of XPath Queries	claim
76	156	Integrating and Ranking Uncertain Scientific Data	claim
77	156	Online Anomaly Prediction for Robust Cluster Systems	claim
78	156	Support Multi-version Applications in SaaS via Progressive Schema Evolution	claim
79	155	Finding Time-Lagged 3D Clusters	claim
80	155	SPROUT: Lazy vs. Eager Query Plans for Tuple-Independent Probabilistic Databases	claim
81	155	Join Optimization of Information Extraction Output: Quality Matters!	claim
82	154	Access Methods for Markovian Streams	claim
83	154	A General Proximity Privacy Principle	claim
84	153	XBLEND: Visual XML Query Formulation Meets Query Processing	claim
85	153	Efficient Distribution of Full-Fledged XQuery	claim
86	153	STAIRS: Towards Efficient Full-Text Filtering and Dissemination in a DHT Environment	claim
87	152	Tree Indexing on Flash Disks	claim
88	151	Decision Trees for Uncertain Data	claim
89	150	Oracle Streams: A High Performance Implementation for Near Real Time Asynchronous Replication	claim
90	149	Online Tuning of Aggregation Tables for OLAP	claim
91	149	OPAQUE: Protecting Path Privacy in Directions Search	claim
92	148	Online Interval Skyline Queries on Time Series	claim
93	148	Probabilistic Inference over RFID Streams in Mobile Environments	claim
94	147	Separating Authentication from Query Execution in Outsourced Databases	claim
95	146	Actively Building Private Recommender Networks for Evolving Reliable Relationships	claim
96	145	Context-Aware Object Connection Discovery in Large Graphs	claim
97	144	Web Query Recommendation via Sequential Query Prediction	claim
98	144	Reachability Indexes for Relational Keyword Search	claim
99	143	Towards Efficient Processing of General-Purpose Joins in Sensor Networks	claim
100	143	Join Reordering by Join Simulation	claim
101	143	iBroker: An Intelligent Broker for Ontology Based Publish/Subscribe Systems	claim
102	143	Fa: A System for Automating Failure Diagnosis	claim
103	143	Auditing a Database under Retention Restrictions	claim
104	143	Supporting Generic Cost Models for Wide-Area Stream Processing	claim
105	143	Incremental Reverse Nearest Neighbor Ranking	claim
106	142	Design Patterns for Internet-Scale Services	claim
107	142	Parallel Skyline Computation on Multicore Architectures	claim
108	141	Privacy Preserving Publishing on Multiple Quasi-identifiers	claim
109	140	Predicting Multiple Metrics for Queries: Better Decisions Enabled by Machine Learning	claim
110	140	Routing Questions to the Right Users in Online Communities	claim
111	139	Minimizing Communication Cost in Distributed Multi-query Processing	claim
112	139	Ranking of Object Summaries	claim
113	138	Similarity Group-By	claim
114	137	Study of Web Delivered Services Support Platform	claim
115	136	A Concise Representation of Range Queries	claim
116	135	Space-Constrained Gram-Based Indexing for Efficient Approximate String Search	claim
117	135	Forward Decay: A Practical Time Decay Model for Streaming Systems	claim
118	134	Non-Exposure Location Anonymity	claim
119	133	STAR: Steiner-Tree Approximation in Relationship Graphs	claim
120	132	Using Anonymized Data for Classification	claim
121	131	Exploring a Few Good Tuples from Text Databases	claim
122	130	A Latent Topic Model for Complete Entity Resolution	claim
123	130	Recursive Computation of Regions and Connectivity in Networks	claim
124	129	Computing Distance Histograms Efficiently in Scientific Databases	claim
125	129	Evaluating TOP-K Queries over Business Processes	claim
126	129	A Static Analysis Framework for Database Applications	claim
127	127	SbQA: A Self-Adaptable Query Allocation Process	claim
128	126	Aggregate Query Answering under Uncertain Schema Mappings	claim
129	126	SAP Business ByDesign	claim
130	126	Instant Advertising in Mobile Peer-to-Peer Networks	claim
131	126	Querying Communities in Relational Databases	claim
132	126	iVA-File: Efficiently Indexing Sparse Wide Tables in Community Systems	claim
133	126	Transaction Support for Log-Based Middleware Server Recovery	claim
134	125	Temporal Outlier Detection in Vehicle Traffic Data	claim
135	125	Automated Diagnosis of System Failures with Fa	claim
136	125	Metric Functional Dependencies	claim
137	124	Shared Winner Determination in Sponsored Search Auctions	claim
138	124	An Architecture for Regulatory Compliant Database Management	claim
139	122	Best-Effort Top-k Query Processing Under Budgetary Constraints	claim
140	122	Universal Resource Lifecycle Management	claim
141	122	Secure Enterprise Services Consumption for SaaS Technology Platforms	claim
142	121	Large-Scale Deduplication with Constraints Using Dedupalog	claim
143	121	Holistic Query Transformations for Dynamic Web Applications	claim
144	121	Scalability for Virtual Worlds	claim
145	120	Shaman: A Self-Healing Database System	claim
146	120	Weighted Proximity Best-Joins for Information Retrieval	claim
147	120	Improving Transaction-Time DBMS Performance and Functionality	claim
148	120	Recommending Join Queries via Query Log Analysis	claim
149	119	SmallBlue: Social Network Analysis for Expertise Search and Collective Intelligence	claim
150	119	Deductive Framework for Programming Sensor Networks	claim
151	118	An Incremental Threshold Method for Continuous Text Search Queries	claim
152	117	Using Semantics for Speech Annotation of Images	claim
153	117	DynaCet: Building Dynamic Faceted Search Systems over Databases	claim
154	115	Histograms and Wavelets on Probabilistic Data	claim
155	115	Efficient Evaluation of Multiple Preference Queries	claim
156	115	X-CSR: Dataflow Optimization for Distributed XML Process Pipelines	claim
157	115	Jelly: A Language for Building Community-Centric Information Exploration Applications	claim
158	114	XOntoRank: Ontology-Aware Search of Electronic Medical Records	claim
159	114	On Efficient Query Processing of Stream Counts on the Cell Processor	claim
160	114	A Spreadsheet Algebra for a Direct Data Manipulation Query Interface	claim
161	113	Keyword Search over Dynamic Categorized Information	claim
162	109	PLUS: A Message-Efficient Prototype for Location-Based Applications	claim
163	108	Galaxy: Encouraging Data Sharing among Sources with Schema Variants	claim
164	106	Dynamic Approaches to In-network Aggregation	claim
165	102	On the Efficiency of Provenance Queries	claim
166	101	Power Hints for Query Optimization	claim
167	100	Recommendation Diversification Using Explanations	claim
168	99	An Internet-Scale Service for Publishing and Locating XML Documents	claim
169	90	Uncertain Location Based Range Aggregates in a Multi-dimensional Space	claim
170	82	WEST: Modern Technologies for Web People Search	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers