Sciweavers

SIGMOD
2008
ACM
102views Database» more  SIGMOD 2008»
14 years 7 months ago
ProSem: scalable wide-area publish/subscribe
We demonstrate ProSem, a scalable wide-area publish/subscribe system that supports complex, stateful subscriptions as well as simple ones. One unique feature of ProSem is its cost...
Badrish Chandramouli, Jun Yang 0001, Pankaj K. Aga...
SIGMOD
2008
ACM
190views Database» more  SIGMOD 2008»
14 years 7 months ago
OLTP through the looking glass, and what we found there
Online Transaction Processing (OLTP) databases include a suite of features -- disk-resident B-trees and heap files, locking-based concurrency control, support for multi-threading ...
Stavros Harizopoulos, Daniel J. Abadi, Samuel Madd...
SIGMOD
2008
ACM
236views Database» more  SIGMOD 2008»
14 years 7 months ago
Approximate embedding-based subsequence matching of time series
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
Vassilis Athitsos, Panagiotis Papapetrou, Michalis...
SIGMOD
2008
ACM
130views Database» more  SIGMOD 2008»
14 years 7 months ago
From del.icio.us to x.qui.site: recommendations in social tagging sites
We present x.qui.site, a scalable system for managing recommendations for social tagging sites like del.icio.us. seamlessly incorporates various user behaviors into the recommenda...
Sihem Amer-Yahia, Alban Galland, Julia Stoyanovich...
SIGMOD
2008
ACM
124views Database» more  SIGMOD 2008»
14 years 7 months ago
Improving suffix array locality for fast pattern matching on disk
Ranjan Sinha, Simon J. Puglisi, Alistair Moffat, A...
SIGMOD
2008
ACM
150views Database» more  SIGMOD 2008»
14 years 7 months ago
LearnPADS: automatic tool generation from ad hoc data
In this demonstration, we will present LEARNPADS, a fully automatic system for generating ad hoc data processing tools. When presented with a collection of ad hoc data, the system...
Kathleen Fisher, David Walker, Kenny Qili Zhu
SIGMOD
2008
ACM
111views Database» more  SIGMOD 2008»
14 years 7 months ago
Discovering bucket orders from full rankings
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a buck...
Jianlin Feng, Qiong Fang, Wilfred Ng
SIGMOD
2008
ACM
139views Database» more  SIGMOD 2008»
14 years 7 months ago
Paths to stardom: calibrating the potential of a peer-based data management system
As peer-to-peer (P2P) networks become more familiar to the database community, intense interest has built up in using their scalability and resilience properties to scale database...
Mihai Lupu, Beng Chin Ooi, Y. C. Tay
SIGMOD
2008
ACM
164views Database» more  SIGMOD 2008»
14 years 7 months ago
Relational-style XML query
We study the problem of querying relational data embedded in XML. Relational data can be represented by various tree structures in XML. However, current XML query methods, such as...
Taro L. Saito, Shinichi Morishita
SIGMOD
2008
ACM
101views Database» more  SIGMOD 2008»
14 years 7 months ago
Pay-as-you-go user feedback for dataspace systems
A primary challenge to large-scale data integration is creating semantic equivalences between elements from different data sources that correspond to the same real-world entity or...
Shawn R. Jeffery, Michael J. Franklin, Alon Y. Hal...