SIGMOD 2010 - PDF Preprint Papers

SIGMOD 2010 International Conference on Management of Data

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed SIGMOD-2010 Paper

click to vote

SIGMOD
2010
ACM

598views Database» more SIGMOD 2010»

Ricardo: integrating R and Hadoop

13 years 9 months ago

Download www.almaden.ibm.com

Many modern enterprises are collecting data at the most detailed level possible, creating data repositories ranging from terabytes to petabytes in size. The ability to apply sophi...

Sudipto Das, Yannis Sismanis, Kevin S. Beyer, Rain...

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	598	Ricardo: integrating R and Hadoop	claim
2	436	Pluggable personal data servers	claim
3	377	Online aggregation and continuous query support in MapReduce	claim
4	364	Optimizing schema-last tuple-store queries in graphd	claim
5	362	Data warehousing and analytics infrastructure at facebook	claim
6	324	Similarity search and locality sensitive hashing using ternary content addressable memories	claim
7	323	Boosting spatial pruning: on optimal pruning of MBRs	claim
8	321	HadoopDB in action: building real world applications	claim
9	312	TwitterMonitor: trend detection over the twitter stream	claim
10	310	The DataPath system: a data-centric analytic processing engine for large data warehouses	claim
11	308	GBLENDER: towards blending visual query formulation and query processing in graph databases	claim
12	305	MoveMine: mining moving object databases	claim
13	281	Continuous sampling for online aggregation over multiple queries	claim
14	277	A comparison of join algorithms for log processing in MaPreduce	claim
15	277	Glacier: a query-to-hardware compiler	claim
16	274	K-isomorphism: privacy preserving network publication against structural attacks	claim
17	273	Google fusion tables: web-centered data management and collaboration	claim
18	269	MapDupReducer: detecting near duplicates over massive datasets	claim
19	267	Processing proximity relations in road networks	claim
20	262	K-nearest neighbor search for fuzzy objects	claim
21	260	Towards proximity pattern mining in large graphs	claim
22	259	PODS: a new model and processing algorithms for uncertain data streams	claim
23	259	An extensible test framework for the Microsoft StreamInsight query processor	claim
24	255	Large graph processing in the cloud	claim
25	255	Indexing multi-dimensional data in a cloud system	claim
26	250	Spreadsheet as a relational database engine	claim
27	250	Expressive and flexible access to web-extracted data: a keyword-based structured query language	claim
28	249	Active knowledge: dynamically enriching RDF knowledge bases by web services	claim
29	249	Worry-free database upgrades: automated model-driven evolution of schemas and complex mappings	claim
30	243	Non-homogeneous generalization in privacy preserving data publishing	claim
31	240	OpenII: an open source information integration toolkit	claim
32	239	Computing label-constraint reachability in graph databases	claim
33	239	Call to order: a hierarchical browsing approach to eliciting users' preference	claim
34	236	Forecasting high-dimensional data	claim
35	236	Differentially private aggregation of distributed time-series with transformation and encryption	claim
36	232	Optimizing content freshness of relations extracted from the web using keyword search	claim
37	231	Automatically incorporating new sources in keyword search-based data integration	claim
38	231	Adaptive query scheduling for mixed database workloads with multiple objectives	claim
39	228	Probabilistic string similarity joins	claim
40	227	SecureBlox: customizable secure distributed data processing	claim
41	224	GDR: a system for guided data repair	claim
42	223	Finding maximal cliques in massive networks by H*-graph	claim
43	221	Low overhead concurrency control for partitioned main memory databases	claim
44	221	Analyzing the energy efficiency of a database server	claim
45	217	Mining knowledge from databases: an information network analysis approach	claim
46	215	Dynamic symbolic database application testing	claim
47	215	Overview of sciDB: large scale array storage, processing and analysis	claim
48	215	Crescando	claim
49	214	ParaTimer: a progress indicator for MapReduce DAGs	claim
50	213	K*SQL: a unifying engine for sequence patterns and XML	claim
51	213	On active learning of record matching packages	claim
52	212	Understanding deep web search interfaces: a survey	claim
53	211	Enterprise information extraction: recent developments and open challenges	claim
54	211	ERACER: a database approach for statistical inference and data cleaning	claim
55	210	Searching trajectories by locations: an efficiency study	claim
56	209	ProgXe: progressive result generation framework for multi-criteria decision support queries	claim
57	208	Efficient parallel set-similarity joins using MapReduce	claim
58	208	Hierarchically organized skew-tolerant histograms for geographic data objects	claim
59	208	An automated, yet interactive and portable DB designer	claim
60	207	Automatic contention detection and amelioration for data-intensive operations	claim
61	207	iTuned: a tool for configuring and visualizing database parameters	claim
62	207	Leveraging spatio-temporal redundancy for RFID data cleansing	claim
63	205	Performing sound flash device measurements: some lessons from uFLIP	claim
64	204	Positional update handling in column stores	claim
65	204	Multi-dimensional keyword-based image annotation and search	claim
66	203	Feeding frenzy: selectively materializing users' event feeds	claim
67	203	An algorithmic approach to event summarization	claim
68	202	PAROS: pareto optimal route selection	claim
69	202	Beyond isolation: research opportunities in declarative data-driven coordination	claim
70	201	I4E: interactive investigation of iterative information extraction	claim
71	200	QRelX: generating meaningful queries that provide cardinality assurance	claim
72	199	Keyword search across databases and documents	claim
73	198	Continuous analytics over discontinuous streams	claim
74	197	TACO: tunable approximate computation of outliers in wireless sensor networks	claim
75	196	Connected substructure similarity search	claim
76	196	GAIA: graph classification using evolutionary computation	claim
77	191	Data conflict resolution using trust mappings	claim
78	189	Recsplorer: recommendation algorithms based on precedence mining	claim
79	189	An evaluation of alternative architectures for transaction processing in the cloud	claim
80	188	A demonstration of FlexPref: extensible preference evaluation inside the DBMS engine	claim
81	187	PIQL: a performance insightful query language	claim
82	186	Fast approximate correlation for massive time-series data	claim
83	186	TEDI: efficient shortest path query answering on graphs	claim
84	184	Load-balanced query dissemination in privacy-aware online communities	claim
85	184	Logging every footstep: quantile summaries for the entire history	claim
86	183	TPC-E vs. TPC-C: characterizing the new TPC-E benchmark via an I/O comparison study	claim
87	182	Query portals: dynamically generating portals for entity-oriented web queries	claim
88	181	Lineage processing over correlated probabilistic databases	claim
89	178	On indexing error-tolerant set containment	claim
90	177	Sedna: native XML database management system (internals overview)	claim
91	176	DCUBE: discrimination discovery in databases	claim
92	175	Ajax-based report pages as incrementally rendered views	claim
93	174	Sampling dirty data for matching attributes	claim
94	174	The SIGMOD 2010 programming contest a distributed query engine	claim
95	173	PR-join: a non-blocking join achieving higher early result rate with statistical guarantees	claim
96	172	Finding maximum degrees in hidden bipartite graphs	claim
97	171	Variance aware optimization of parameterized queries	claim
98	171	An optimal labeling scheme for workflow provenance using skeleton labels	claim
99	171	Report on the EDBT/ICDT 2010 workshop on updates in XML	claim
100	170	Querying data provenance	claim
101	169	Information theory for data management	claim
102	168	SimDB: a similarity-aware database system	claim
103	167	Efficient querying and maintenance of network provenance at internet-scale	claim
104	166	Efficient two-sided error-tolerant search	claim
105	166	FAST: fast architecture sensitive tree search on modern CPUs and GPUs	claim
106	166	Search result diversification	claim
107	165	Creating and exploring web form repositories	claim
108	164	Efficiently evaluating complex boolean expressions	claim
109	164	Preserving privacy and fairness in peer-to-peer data integration	claim
110	161	Query recommendation in digital libraries using OLAP	claim
111	159	Histograms reloaded: the merits of bucket diversity	claim
112	158	A case for online mixed workload processing	claim
113	157	Workload-aware storage layout for database systems	claim
114	157	Structured data retrieval using cover density ranking	claim
115	155	Querying RDF streams with C-SPARQL	claim
116	155	Search in social networks with access control	claim
117	155	13th international workshop on the web and databases: WebDB 2010	claim
118	154	Unbiased estimation of size and other aggregates over hidden web databases	claim
119	153	Threshold query optimization for uncertain data	claim
120	151	Constructing and exploring composite items	claim
121	151	Exploring schema similarity at multiple resolutions	claim
122	149	Report on the first international workshop on cloud data management (CloudDB 2009)	claim
123	149	On models and query languages for probabilistic processes	claim
124	145	How to ConQueR why-not questions	claim
125	144	Interactive visual exploration of neighbor-based patterns in data streams	claim
126	144	Scalable SQL and NoSQL data stores	claim
127	139	Schema clustering and retrieval for multi-domain pay-as-you-go data integration systems	claim
128	139	Scalable architecture and query optimization fortransaction-time DBs with evolving schemas	claim
129	132	Durable top-k search in document archives	claim
130	131	The declarative imperative: experiences and conjectures in distributed logic	claim
131	120	Paper bricks: an alternative to complete-story peer reviewing	claim
132	115	Emerging multidisciplinary research across database management systems	claim
133	109	Towards a computational transportation science	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers