ICDE 2010 - PDF Preprint Papers

ICDE 2010 International Conference on Data Engineering

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ICDE-2010 Paper

click to vote

ICDE
2010
IEEE

874views Database» more ICDE 2010»

UV-Diagram: A Voronoi Diagram for Uncertain Data

14 years 11 months ago

Download i.cs.hku.hk

The Voronoi diagram is an important technique for answering nearest-neighbor queries for spatial databases. In this paper, we study how the Voronoi diagram can be used on uncertain...

Reynold Cheng, Xike Xie, Man Lung Yiu, Jinchuan Ch...

claim paper

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	874	UV-Diagram: A Voronoi Diagram for Uncertain Data	claim
2	801	The Similarity Join Database Operator	claim
3	750	Efficient and accurate discovery of patterns in sequence datasets	claim
4	568	Reverse Top-k Queries	claim
5	562	Multi-Guarded Safe Zone: An Effective Technique to Monitor Moving Circular Range Queries	claim
6	539	Impact of Disk Corruption on Open-Source DBMS	claim
7	494	Hashing Tree-Structured Data: Methods and Applications	claim
8	491	TrajStore: An Adaptive Storage System for Very Large Trajectory Data Sets	claim
9	472	TransDec: A Spatiotemporal Query Processing Framework for Transportation Systems	claim
10	439	Nb-GCLOCK: A Non-blocking Buffer Management Based on the Generalized CLOCK	claim
11	434	Progressive Result Generation for Multi-Criteria Decision Support Queries	claim
12	434	Route skyline queries: A multi-preference path planning approach	claim
13	428	Supporting Top-K Keyword Search in XML Databases	claim
14	408	Hive - a petabyte scale data warehouse using Hadoop	claim
15	401	Continuous Query Evaluation over Distributed Sensor Networks	claim
16	399	Discovery-driven graph summarization	claim
17	379	Osprey: Implementing MapReduce-Style Fault Tolerance in a Shared-Nothing Distributed Database	claim
18	379	Credibility-enhanced Curated Database: Improving the Value of Curated Databases	claim
19	371	TASM: Top-k Approximate Subtree Matching	claim
20	359	Policy-Aware Sender Anonymity in Location Based Services	claim
21	359	T-Warehouse: Visual OLAP analysis on trajectory data	claim
22	331	Navigation system for product search	claim
23	322	XML-Based Computation for Scientific Workflows	claim
24	311	Detecting Inconsistencies in Distributed Data	claim
25	295	K nearest neighbor queries and kNN-Joins in large relational databases (almost) for free	claim
26	292	Usher: Improving Data Quality With Dynamic Forms	claim
27	292	Exploring Power-Performance Tradeoffs in Database Systems	claim
28	290	The Model-Summary Problem and a Solution for Trees	claim
29	290	Evaluating path queries over route collections	claim
30	288	Global Iceberg Detection over Distributed Data Streams	claim
31	288	Fast In-Memory XPath Search using Compressed Indexes	claim
32	283	Personalized Web Search with Location Preferences	claim
33	282	Quantile-Based KNN Over Multi-Valued Objects	claim
34	276	X-data: Generating test data for killing SQL mutants	claim
35	273	WikiAnalytics: Ad-hoc Querying of Highly Heterogeneous Structured Data	claim
36	272	SMARTINT: A System for Answering Queries over Web Databases Using Attribute Dependencies	claim
37	271	Preference Queries in Large Multi-Cost Transportation Networks	claim
38	268	Techniques for Efficiently Searching in Spatial, Temporal, Spatio-temporal, and Multimedia Databases	claim
39	266	Provenance Browser: Displaying and Querying Scientific Workflow Provenance Graphs	claim
40	266	Ranking for data repairs	claim
41	263	Managing Uncertainty of XML Schema Matching	claim
42	262	Approximate String Search in Spatial Databases	claim
43	260	Locating Mapped Resources in Web 2.0	claim
44	260	Anonymizing Weighted Social Network Graphs	claim
45	258	Anonymized Data: Generation, models, usage	claim
46	255	On supporting effective web extraction	claim
47	254	Efficient Rank Based KNN Query Processing Over Uncertain Data	claim
48	252	Semantic Ranking and Result Visualization for Life Sciences Publications	claim
49	251	Viewing a World of Annotations through AnnoVIP	claim
50	250	Optimized Query Evaluation Using Cooperative Sorts	claim
51	249	PARINET: A tunable access method for in-network trajectories	claim
52	248	FPGA Acceleration for the Frequent Item Problem	claim
53	248	Similarity Search on Supergraph Containment	claim
54	248	MashRank: Towards uncertainty-aware and rank-aware mashups	claim
55	247	Efficient Verification of Shortest Path Search via Authenticated Hints	claim
56	246	Admission Control Mechanisms for Continuous Queries in the Cloud	claim
57	244	Reliable Storage and Querying for Collaborative Data Sharing Systems	claim
58	244	Propagating Updates Through XML Views Using Lineage Tracing	claim
59	243	Probabilistic Contextual Skylines	claim
60	243	Geotagging with local lexicons to build indexes for textually-specified spatial data	claim
61	241	FlexPref: A Framework for Extensible Preference Evaluation in Database Systems	claim
62	241	Privometer: Privacy protection in social networks	claim
63	240	Top-K aggregation queries over large networks	claim
64	238	Correlation hiding by independence masking	claim
65	236	Supporting Real-world Activities in Database Management Systems	claim
66	236	Explaining Structured Queries in Natural Language	claim
67	235	Cost-efficient and Differentiated Data Availability Guarantees in Data Clouds	claim
68	235	Privacy in Data Publishing	claim
69	233	Polynomial heuristics for query optimization	claim
70	231	Estimating the progress of MapReduce pipelines	claim
71	228	Strongly consistent replication for a bargain	claim
72	227	Approximate Confidence Computation in Probabilistic Databases	claim
73	227	Incorporating partitioning and parallel plans into the SCOPE optimizer	claim
74	226	Approximation Trade-Offs in Markovian Stream Processing: An Empirical Study	claim
75	224	Probabilistic Declarative Information Extraction	claim
76	224	Inconsistency resolution in online databases	claim
77	224	Partitioning real-time ETL workflows	claim
78	222	Finding Clusters in subspaces of very large, multi-dimensional datasets	claim
79	221	A generic auto-provisioning framework for cloud databases	claim
80	220	Profiling linked open data with ProLOD	claim
81	219	PIP: A Database System for Great and Small Expectations	claim
82	217	Toward industrial-strength keyword search systems over relational data	claim
83	214	Differential Privacy via Wavelet Transforms	claim
84	214	The Entity Name System: Enabling the web of entities	claim
85	213	TargetSearch: A Ranking Friendly XML Keyword Search Engine	claim
86	212	ViewJoin: Efficient View-based Evaluation of Tree Pattern Queries	claim
87	212	Cleansing uncertain databases leveraging aggregate constraints	claim
88	211	ROX: The robustness of a run-time XQuery optimizer against correlated data	claim
89	210	IQ^P: Incremental Query Construction, a Probabilistic Approach	claim
90	209	Optimal tree node ordering for child/descendant navigations	claim
91	209	TopCells: Keyword-based search of top-k aggregated documents in text cube	claim
92	209	Overlapping Community Search for social networks	claim
93	208	Intensional Associations in Dataspaces	claim
94	208	Duplicate detection in probabilistic data	claim
95	206	Evaluating skylines in the presence of equijoins	claim
96	206	HECATAEUS: Regulating Schema Evolution	claim
97	204	ProbClean: A probabilistic duplicate detection system	claim
98	203	Optimizing ETL workflows for fault-tolerance	claim
99	202	Generating code for holistic query evaluation	claim
100	202	Ranked Queries over Sources with Boolean Query Interfaces without Ranking Support	claim
101	201	Interactive Physical Design Tuning	claim
102	201	Vertical partitioning of relational OLTP databases using integer programming	claim
103	200	GenerIE: Information extraction using database queries	claim
104	200	Towards better entity resolution techniques for Web document collections	claim
105	199	Fuzzy Matching of Web Queries to Structured Data	claim
106	199	A Demonstration of the MaxStream Federated Stream Processing System	claim
107	199	Mining mutation chains in biological sequences	claim
108	199	XMorph: A Shape-Polymorphic, Domain-Specific XML Data Transformation Language	claim
109	198	Q-Cop: Avoiding Bad Query Mixes to Minimize Client Timeouts Under Heavy Loads	claim
110	198	Power-aware data analysis in sensor networks	claim
111	197	Monitoring Continuous State Violation in Datacenters: Exploring the Time Dimension	claim
112	195	Interaction-Aware Prediction of Business-Intelligence Workload Completion Times	claim
113	195	Statistics-driven workload modeling for the Cloud	claim
114	195	Automatic tuning of the multiprogramming level in Sybase SQL Anywhere	claim
115	195	Advances in constrained clustering	claim
116	194	XColor: Protecting General Proximity Privacy	claim
117	194	Visualizing cost-based XQuery optimization	claim
118	193	Schema covering: a step towards enabling reuse in information integration	claim
119	192	XML reasoning made practical	claim
120	191	Coordination of data in heterogenous domains	claim
121	189	I/O-Efficient Statistical Computing with RIOT	claim
122	189	Caching all plans with just one optimizer call	claim
123	188	Space-efficient Online Approximation of Time Series Data: Streams, Amnesia, and Out-of-order	claim
124	187	A Privacy-Preserving Approach to Policy-Based Content Dissemination	claim
125	186	Mini-Me: A Min-Repro System for Database Software	claim
126	185	A tuple space for social networking on mobile phones	claim
127	184	On optimal anonymization for l+-diversity	claim
128	183	Estimating the compression fraction of an index using sampling	claim
129	183	A first step towards integration independence	claim
130	182	Global Privacy Guarantee in Serial Data Publishing	claim
131	181	Navigating through Mashed-up Applications with COMPASS	claim
132	181	Toward large scale data-aware search: Ranking, indexing, resolution and beyond	claim
133	180	On novelty in publish/subscribe delivery	claim
134	180	Streaming data integration: Challenges and opportunities	claim
135	180	Adaptive indexing for relational keys	claim
136	178	Autonomic workload execution control using throttling	claim
137	178	The Hybrid-Layer Index: A synergic approach to answering top-k queries in arbitrary subspaces	claim
138	177	Optimal load shedding with aggregates and mining queries	claim
139	176	Efficient fuzzy type-ahead search in TASTIER	claim
140	176	CareDB: A context and preference-aware location-based database system	claim
141	174	Semantic flooding: Search over semantic links	claim
142	173	Progressive clustering of networks using Structure-Connected Order of Traversal	claim
143	172	Rule profiling for query optimizers and their implications	claim
144	172	On the use of query-driven XML auto-indexing	claim
145	171	Surrogate Ranking for Very Expensive Similarity Queries	claim
146	170	Workload Driven Index Defragmentation	claim
147	169	Improving product search with economic theory	claim
148	168	Privacy-preserving data publishing	claim
149	167	Top-k pipe join	claim
150	158	Complement union for data integration	claim
151	157	Subspace similarity search using the ideas of ranking and top-k retrieval	claim
152	154	Processing online news streams for large-scale semantic analysis	claim
153	151	Fast algorithms for time series mining	claim
154	145	MASS: a multi-facet domain-specific influential blogger mining system	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers