PVLDB 2010 - PDF Preprint Papers

PVLDB 2010

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed PVLDB-2010 Paper

click to vote

PVLDB
2010

342views more PVLDB 2010»

CRIUS: User-Friendly Database Design

13 years 11 months ago

Download www.vldb.org

Non-technical users are increasingly adding structures to their data. This gives rise to the need for database design. However, traditional database design is deliberate and heavy...

Li Qian, Kristen LeFevre, H. V. Jagadish

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	342	CRIUS: User-Friendly Database Design	claim
2	269	Shortest Path Computation on Air Indexes	claim
3	252	Efficient and Effective Similarity Search over Probabilistic Data based on Earth Mover's Distance	claim
4	225	Efficient Processing of Top-k Spatial Preference Queries	claim
5	220	Fast Incremental and Personalized PageRank	claim
6	219	Deep Web Integration with VisQI	claim
7	204	Cheetah: A High Performance, Custom Data Warehouse on Top of MapReduce	claim
8	200	SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs	claim
9	195	Keyword++: A Framework to Improve Keyword Search Over Entity Databases	claim
10	195	Trie-Join: Efficient Trie-based String Similarity Joins with Edit-Distance Constraints	claim
11	191	SnipSuggest: Context-Aware Autocompletion for SQL	claim
12	190	Efficient B-tree Based Indexing for Cloud Data Processing	claim
13	189	Slicing Long-Running Queries	claim
14	184	Adaptive Logging for Mobile Device	claim
15	184	TimeTrails: A System for Exploring Spatio-Temporal Information in Documents	claim
16	179	Nearest Neighbor Search with Strong Location Privacy	claim
17	179	MRShare: Sharing Across Multiple Queries in MapReduce	claim
18	178	Hadoop++: Making a Yellow Elephant Run Like a Cheetah (Without It Even Noticing)	claim
19	175	Dynamic Join Optimization in Multi-Hop Wireless Sensor Networks	claim
20	174	x-RDF-3X: Fast Querying, High Update Rates, and Consistency for RDF Databases	claim
21	172	Secure Personal Data Servers: a Vision Paper	claim
22	172	Database-support for Continuous Prediction Queries over Streaming Data	claim
23	168	Transforming XML Documents as Schemas Evolve	claim
24	168	Active Complex Event Processing: Applications in Real-Time Health Care	claim
25	167	The Performance of MapReduce: An In-depth Study	claim
26	167	Runtime Measurements in the Cloud: Observing, Analyzing, and Reducing Variance	claim
27	166	Towards Elastic Transactional Cloud Storage with Range Query Support	claim
28	166	Complex Event Detection at Wire Speed with FPGAs	claim
29	166	An Adaptive Updating Protocol for Reducing Moving Object Databases Workload	claim
30	164	FlashStore: High Throughput Persistent Key-Value Store	claim
31	163	Event Processing - past, present and future	claim
32	163	Geospatial Stream Query Processing using Microsoft SQL Server StreamInsight	claim
33	161	Annotating and Searching Web Tables Using Entities, Types and Relationships	claim
34	159	Explore or Exploit? Effective Strategies for Disambiguating Large Databases	claim
35	158	MEET DB2: Automated Database Migration Evaluation	claim
36	158	Building Ranked Mashups of Unstructured Sources with Uncertain Information	claim
37	152	k-Nearest Neighbors in Uncertain Graphs	claim
38	151	Database Compression on Graphics Processors	claim
39	151	Scalable Discovery of Best Clusters on Large Graphs	claim
40	151	Advanced Processing for Ontological Queries	claim
41	151	Data Auditor: Exploring Data Quality and Semantics using Pattern Tableaux	claim
42	151	A Generic Framework for Handling Uncertain Data with Local Correlations	claim
43	150	Tree Indexing on Solid State Drives	claim
44	150	DataGarage: Warehousing Massive Performance Data on Commodity Servers	claim
45	149	GRAIL: Scalable Reachability Index for Large Graphs	claim
46	147	HYRISE - A Main Memory Hybrid Storage Engine	claim
47	147	Automatic Rule Refinement for Information Extraction	claim
48	146	Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions	claim
49	146	HaLoop: Efficient Iterative Data Processing on Large Clusters	claim
50	146	Generating Efficient Execution Plans for Vertically Partitioned XML Databases	claim
51	145	Keymantic: Semantic Keyword-based Searching in Data Integration Systems	claim
52	145	Big Data and Cloud Computing: New Wine or just New Bottles?	claim
53	145	Using XMorph to Transform XML Data	claim
54	143	Embellishing Text Search Queries To Protect User Privacy	claim
55	142	Distributed Caching Platforms	claim
56	140	Optimal Top-K Query Evaluation for Weighted Business Processes	claim
57	139	Aether: A Scalable Approach to Logging	claim
58	139	Identifying the Most Influential Data Objects with Reverse Top-k Queries	claim
59	138	The Case for Determinism in Database Systems	claim
60	136	SigMatch: Fast and Scalable Multi-Pattern Matching	claim
61	135	Similarity Search and Mining in Uncertain Databases	claim
62	135	P2PDocTagger: Content management through automated P2P collaborative tagging	claim
63	135	SXPath - Extending XPath towards Spatial Querying on Web Documents	claim
64	135	Efficient Skyline Evaluation over Partially Ordered Domains	claim
65	135	QSkycube: Efficient Skycube Computation using Point-Based Space Partitioning	claim
66	134	High-Performance Dynamic Pattern Matching over Disordered Streams	claim
67	134	Conditioning and Aggregating Uncertain Data Streams: Going Beyond Expectations	claim
68	133	RoadTrack: Scaling Location Updates for Mobile Clients on Road Networks with Query Awareness	claim
69	132	CoDA: Interactive Cluster Based Concept Discovery	claim
70	131	XSACT: A Comparison Tool for Structured Search Results	claim
71	129	iGraph: A Framework for Comparisons of Disk-Based Graph Indexing Techniques	claim
72	129	Entity Resolution with Evolving Rules	claim
73	129	Graph Pattern Matching: From Intractable to Polynomial Time	claim
74	129	AXART - Enabling Collaborative Work with AXML Artifacts	claim
75	128	Update Rewriting and Integrity Constraint Maintenance in a Schema Evolution Support System: PRISM++	claim
76	128	Searching Workflows with Hierarchical Views	claim
77	127	Identifying, Attributing and Describing Spatial Bursts	claim
78	127	Mining Significant Semantic Locations From GPS Data	claim
79	126	Set Similarity Join on Probabilistic Data	claim
80	125	Interesting-Phrase Mining for Ad-Hoc Text Analytics	claim
81	125	MapMerge: Correlating Independent Schema Mappings	claim
82	125	The Impact of Virtual Views on Containment	claim
83	123	Toward Scalable Keyword Search over Relational Data	claim
84	123	Sharing-Aware Horizontal Partitioning for Exploiting Correlations During Query Processing	claim
85	123	Output URL Bidding	claim
86	122	Database Replication: a Tale of Research across Communities	claim
87	122	Avalanche-Safe LINQ Compilation	claim
88	122	On Graph Query Optimization in Large Networks	claim
89	122	From a Stream of Relational Queries to Distributed Stream Processing	claim
90	122	ZINC: Efficient Indexing for Skyline Computation	claim
91	121	Personalized Privacy Protection in Social Networks	claim
92	121	Efficient RkNN Retrieval with Arbitrary Non-Metric Similarity Measures	claim
93	120	Sampling the Repairs of Functional Dependency Violations under Hard Constraints	claim
94	120	Cloudy: A Modular Cloud Storage System	claim
95	120	EXTRUCT: Using Deep Structural Information in XML Keyword Search	claim
96	119	An Architecture for Parallel Topic Models	claim
97	119	Chase Termination: A Constraints Rewriting Approach	claim
98	118	Ten Thousand SQLs: Parallel Keyword Queries Computing	claim
99	118	Global Detection of Complex Copying Relationships Between Sources	claim
100	117	Distance-Based Outlier Detection: Consolidation and Renewed Bearing	claim
101	117	Building Disclosure Risk Aware Query Optimizers for Relational Databases	claim
102	116	Schism: a Workload-Driven Approach to Database Replication and Partitioning	claim
103	116	Computing Closed Skycubes	claim
104	115	ROXXI: Reviving witness dOcuments to eXplore eXtracted Information	claim
105	115	CORADD: Correlation Aware Database Designer for Materialized Views and Indexes	claim
106	114	Peer coordination through distributed triggers	claim
107	114	ObjectRunner: Lightweight, Targeted Extraction and Querying of Structured Web Data	claim
108	112	Querying Probabilistic Information Extraction	claim
109	112	Two-way Replacement Selection	claim
110	112	Towards The Web of Concepts: Extracting Concepts from Large Datasets	claim
111	112	On Triangulation-based Dense Neighborhood Graphs Discovery	claim
112	112	CODS: Evolving Data Efficiently and Scalably in Column Oriented Databases	claim
113	111	PolicyReplay: Misconfiguration-Response Queries for Data Breach Reporting	claim
114	111	Net-Fli: On-the-fly Compression, Archiving and Indexing of Streaming Network Traffic	claim
115	110	Behavior Based Record Linkage	claim
116	110	Evaluation of entity resolution approaches on real-world match problems	claim
117	110	Read-Once Functions and Query Evaluation in Probabilistic Databases	claim
118	110	Graph Homomorphism Revisited for Graph Matching	claim
119	108	Retrieving Top-k Prestige-Based Relevant Spatial Web Objects	claim
120	107	On Multi-Column Foreign Key Discovery	claim
121	106	Just-in-time Data Integration in Action	claim
122	105	Destabilizers and Independence of XML Updates	claim
123	105	A Probabilistic Approach for Automatically Filling Form-Based Web Interfaces	claim
124	104	Boosting the Accuracy of Differentially Private Histograms Through Consistency	claim
125	104	MCDB-R: Risk Analysis in the Database	claim
126	103	Probabilistic XML via Markov Chains	claim
127	103	Fast Optimal Twig Joins	claim
128	102	SQL QueRIE Recommendations	claim
129	101	InZeit: Efficiently Identifying Insightful Time Points	claim
130	100	Efficient Proximity Detection among Mobile Users via Self-Tuning Policies	claim
131	99	Towards Certain Fixes with Editing Rules and Master Data	claim
132	98	Dremel: Interactive Analysis of Web-Scale Datasets	claim
133	98	On-the-Fly Entity-Aware Query Processing in the Presence of Linkage	claim
134	97	Ranking Continuous Probabilistic Datasets	claim
135	97	Generating Databases for Query Workloads	claim
136	97	Explaining Missing Answers to SPJUA Queries	claim
137	97	TRAMP: Understanding the Behavior of Schema Mappings through Provenance	claim
138	96	Scalable Data Exchange with Functional Dependencies	claim
139	96	Foundations of Uncertain-Data Integration	claim
140	95	Small Domain Randomization: Same Privacy, More Utility	claim
141	94	Efficient Event Processing through Reconfigurable Hardware for Algorithmic Trading	claim
142	94	From Regular Expressions to Nested Words: Unifying Languages and Query Execution for Relational and XML Sequences	claim
143	93	Distributed Threshold Querying of General Functions by a Difference of Monotonic Representation	claim
144	92	Proximity Rank Join	claim
145	92	SSD Bufferpool Extensions for Database Systems	claim
146	91	Regret-Minimizing Representative Databases	claim
147	91	Navigating in Complex Mashed-Up Applications	claim
148	90	The HV-tree: a Memory Hierarchy Aware Version Index	claim
149	89	Transforming Range Queries To Equivalent Box Queries To Optimize Page Access	claim
150	89	Recognizing Patterns in Streams with Imprecise Timestamps	claim
151	89	On the Stability of Plan Costs and the Costs of Plan Stability	claim
152	87	Techniques for Similarity Searching in Multimedia Databases	claim
153	87	Data Management and Mining in Internet Ad Systems	claim
154	86	On Dense Pattern Mining in Graph Streams	claim
155	86	Swarm: Mining Relaxed Temporal Moving Object Clusters	claim
156	86	Thirteen New Players in the Team: A Ferry-based LINQ to SQL Provider	claim
157	85	Xplus: A SQL-Tuning-Aware Query Optimizer	claim
158	85	Enabling Real Time Data Analysis	claim
159	85	Evaluating Entity Resolution Results	claim
160	84	Processing Top-k Join Queries	claim
161	83	Updatable and Evolvable Transforms for Virtual Databases	claim
162	82	SECRET: A Model for Analysis of the Execution Semantics of Stream Processing Systems	claim
163	82	Energy Management for MapReduce Clusters	claim
164	82	Record Linkage with Uniqueness Constraints and Erroneous Values	claim
165	81	SOLOMON: Seeking the Truth Via Copying Detection	claim
166	80	Fragments and Loose Associations: Respecting Privacy in Data Publishing	claim
167	80	Using Sentinel Technology in the TARGIT BI Suite	claim
168	76	Interactive Route Search in the Presence of Order Constraints	claim
169	75	Data-Oriented Transaction Execution	claim
170	75	Parsimonious Linear Fingerprinting for Time Series	claim
171	72	QUICK: Expressive and Flexible Search over Knowledge Bases and Text Collections	claim
172	67	Massively Parallel Data Analysis with PACTs on Nephele	claim
173	66	Seaform: Search-As-You-Type in Forms	claim
174	65	A*-tree: A Structure for Storage and Modeling of Uncertain Multidimensional Arrays	claim
175	65	Minimizing Minimality and Maximizing Utility: Analyzing Method-based attacks on Anonymized Data	claim
176	56	The Picasso Database Query Optimizer Visualizer	claim
177	45	UPI: A Primary Index for Uncertain Databases	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers