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

566views Database» more ICDE 2010»

The Similarity Join Database Operator

2 years 1 months ago

Download www.cs.purdue.edu

Similarity joins have been studied as key operations in multiple application domains, e.g., record linkage, data cleaning, multimedia and video applications, and phenomena detectio...

Mohamed H. Ali, Walid G. Aref, Yasin N. Silva

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

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers