Search For:

Displaying 1-15 out of 15 total
Many-to-Many Aggregation for Sensor Networks
Found in: Data Engineering, International Conference on
By Adam Silberstein, Jun Yang
Issue Date:April 2007
pp. 986-995
Wireless sensor networks have enormous potential to aid data collection in a number of areas, such as environmental and wildlife research. In this paper, we address the challenges of supporting many-to-many aggregation in a sensor network. An application o...
 
Energy-Efficient Continuous Isoline Queries in Sensor Networks
Found in: Data Engineering, International Conference on
By Adam Silberstein, Rebecca Braynard, Jun Yang
Issue Date:April 2006
pp. 145
Environmental monitoring is a promising application for sensor networks. Many scenarios produce geographically correlated readings, making them visually interesting and good targets for the isoline query. This query depicts boundaries showing how values ch...
 
BOXes: Efficient Maintenance of Order-Based Labeling for Dynamic XML Data
Found in: Data Engineering, International Conference on
By Adam Silberstein, Hao He, Ke Yi, Jun Yang
Issue Date:April 2005
pp. 285-296
Order-based element labeling for tree-structured XML data is an important technique in XML processing. It lies at the core of many fundamental XML operations such as containment join and twig matching. While labeling for static XML documents is well unders...
 
NEXSORT: Sorting XML in External Memory
Found in: Data Engineering, International Conference on
By Adam Silberstein, Jun Yang
Issue Date:April 2004
pp. 695
XML plays an important role in delivering data over the Internet, and the need to store and manipulate XML in its native format has become increasingly relevant. This growing need necessitates work on developing native XML operators, especially for one as ...
 
PNUTS in Flight: Web-Scale Data Serving at Yahoo
Found in: IEEE Internet Computing
By Adam Silberstein,Jianjun Chen,David Lomax,Brad McMillan,Masood Mortazavi,P.P.S. Narayan,Raghu Ramakrishnan,Russell Sears
Issue Date:January 2012
pp. 13-23
Data management for stateful Web applications is extremely challenging. Applications must scale as they grow in popularity, serve their content with low latency on a global scale, and be highly available, even in the face of hardware failures. This need ha...
 
HotROD: Managing grid storage with on-demand replication
Found in: 2013 IEEE 29th International Conference on Data Engineering Workshops (ICDEW)
By Sriram Rao,Benjamin Reed,Adam Silberstein
Issue Date:April 2013
pp. 243-249
Enterprises (such as, Yahoo!, LinkedIn, Facebook) operate their own compute/storage infrastructure, which is effectively a “private cloud”. The private cloud consists of multiple clusters, each of which is managed independently. With HDFS, whenever data is...
   
Cache refreshing for online social news feeds
Found in: Proceedings of the 22nd ACM international conference on Conference on information & knowledge management (CIKM '13)
By Adam Silberstein, Flavio P. Junqueira, Xiao Bai
Issue Date:October 2013
pp. 787-792
Several social networking applications enable users to view the events generated by other users, typically friends in the social network, in the form of ``news feeds''. Friends and events are typically maintained per user and cached in memory to enable eff...
     
CloudDB 2012: fourth international workshop on cloud data management
Found in: Proceedings of the 21st ACM international conference on Information and knowledge management (CIKM '12)
By Adam Silberstein, Fusheng Wang, Xiaofeng Meng
Issue Date:October 2012
pp. 2754-2755
The fourth ACM international workshop on cloud data management is held in Maui, Hawaii, USA on October 29, 2012 and co-located with the ACM 21th Conference on Information and Knowledge Management (CIKM). The main objective of the workshop is to address the...
     
The Yahoo!: cloud datastore load balancer
Found in: Proceedings of the fourth international workshop on Cloud data management (CloudDB '12)
By Adam Silberstein, Adwait Tumbde, Brian Cooper, Jianjun Chen, Markus Klems, Masood Mortazavi, P.P.S. Narayan, Sahaya Andrews Albert
Issue Date:October 2012
pp. 33-40
Sherpa is a large-scale distributed and globally replicated multi-tenant cloud data storage system. Sherpa scales by horizontally partitioning data into tablets and distributing these tablets across multiple servers. While Sherpa scales for increasing work...
     
Shepherding social feed generation with Sheep
Found in: Proceedings of the Fifth Workshop on Social Network Systems (SNS '12)
By Adam Silberstein, Marco Serafini, Vincent Leroy, Flavio P. Junqueira
Issue Date:April 2012
pp. 1-6
Social feeds are used in many popular Web applications. They let users produce events, as well as read feeds containing the events generated by their friends. This paper investigates the design of an in-memory platform to manage social feeds. We show that ...
     
Feed following: the big data challenge in social applications
Found in: Databases and Social Networks (DBSocial '11)
By Adam Silberstein, Ashwin Machanavajjhala, Raghu Ramakrishnan
Issue Date:June 2011
pp. 1-6
Internet users spend billions of minutes per month on sites like Facebook and Twitter. These sites support feed following, where users "follow" activity streams associated with other users and entities. Followers get personalized feeds that blend streams p...
     
Asynchronous view maintenance for VLSD databases
Found in: Proceedings of the 35th SIGMOD international conference on Management of data (SIGMOD '09)
By Adam Silberstein, Brian F. Cooper, Parag Agrawal, Raghu Ramakrishnan, Utkarsh Srivastava
Issue Date:June 2009
pp. 3-4
The query models of the recent generation of very large scale distributed (VLSD) shared-nothing data storage systems, including our own PNUTS and others (e.g. BigTable, Dynamo, Cassandra, etc.) are intentionally simple, focusing on simple lookups and scans...
     
Efficient bulk insertion into a distributed ordered table
Found in: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (SIGMOD '08)
By Adam Silberstein, Brian F. Cooper, Erik Vee, Raghu Ramakrishnan, Ramana Yerneni, Utkarsh Srivastava
Issue Date:June 2008
pp. 13-14
We study the problem of bulk-inserting records into tables in a system that horizontally range-partitions data over a large cluster of shared-nothing machines. Each table partition contains a contiguous portion of the table's key range, and must accept all...
     
Energy-efficient monitoring of extreme values in sensor networks
Found in: Proceedings of the 2006 ACM SIGMOD international conference on Management of data (SIGMOD '06)
By Adam Silberstein, Jun Yang, Kamesh Munagala
Issue Date:June 2006
pp. 169-180
Monitoring extreme values (MAX or MIN) is a fundamental problem in wireless sensor networks (and in general, complex dynamic systems). This problem presents very different algorithmic challenges from aggregate and selection queries, in the sense that an in...
     
Constraint chaining: on energy-efficient continuous monitoring in sensor networks
Found in: Proceedings of the 2006 ACM SIGMOD international conference on Management of data (SIGMOD '06)
By Adam Silberstein, Jun Yang, Rebecca Braynard
Issue Date:June 2006
pp. 157-168
Wireless sensor networks have created new opportunities for data collection in a variety of scenarios, such as environmental and industrial, where we expect data to be temporally and spatially correlated. Researchers may want to continuously collect all se...
     
 1