While video game play streaming and archiving through sites such as Twitch.tv is an increasingly relevant and commercially viable practice, limitations of many of those systems ultimately cost end-users the chance to view the most-relevant streams at the moment they need them. Furthermore, while SDKs for in-game event and metric gathering are becoming prevalent, they are not typically combined with real-time pattern matching capabilities of any sophistication and, therefore, will generally fail to allow `deep' matching between gamers and the game streams of highest relevance. This work in progress paper reports on a framework that will, when complete, fill major gaps in video game stream profiling, indexing, search, and usability (for players), and will be positioned as an offering for game developers and aggregators.

We study the problem of privately performing database queries (i.e., keyword searches and conjunctions over them), where a server provides its own database for a client’s query-based access. We propose a cryptographic model for the study of such protocols, by expanding previous well-studied models of keyword search and private information retrieval to incorporate a more practical data model: a time-varying, multi-attribute and multiple-occurrence database table. Our first result is a 2-party private database retrieval protocol. This is the first protocol that preserves query and data privacy on such a practical data model. Like all previous work in private information retrieval and keyword search, this protocol still satisfies server time complexity linear in the database size. Our main result is a private database retrieval protocol in a 3-party model where encrypted data is outsourced to a third party (i.e., a cloud server), satisfying highly desirable privacy and efficiency properties; most notably: (1) no unintended information is leaked to clients or servers, and only minimal ‘access pattern’ information is leaked to the third party; (2) for each query, all parties run in time only logarithmic in the number of database records; (3) the protocol’s runtime is practical for real-life applications, as shown in our implementation where we achieve response time that is only a small constant slower than commercial non-private protocols like MySQL. This is the first protocol that achieves privacy of database and query content with practical performance. Finally, we show a second private database retrieval protocol in the 3-party model for which we can show that no unintended information is leaked to an adversary corrupting both clients and third parties, at an only constant additional performance overhead cost.

Information filtering and personalization are central to the viability of many advanced connected services that are currently being developed for mobile consumer electronic devices. The usability of these services is closely tied to their ability to offer relevant, context sensitive information while shielding the user from both information overload and missing information that she/he did not know to ask for. Furthermore, in many cases, groups of users may use such services in social situations and this dictates the need for deriving group preferences which are based on the preferences of individual group members. In this paper we present a unified information filtering and personalization model that captures the above features. In addition, we present preliminary results from a case study that provides supporting evidence for our unified model.

Mobile application service providers are trying to strike a balance between offering personalized services and safeguarding user privacy. Being able to offer targeted and relevant services requires access to sensitive user information, such as health records, financial transactions, preferences, and location. Users, on the other hand, are reluctant to allow access to their sensitive information when no mechanisms are in place to ensure the proper usage of this information. In this paper, we describe TASER, a trusted gateway between service providers and sensitive information owners. TASER ensures that only authorized and reputable service providers are given access to sensitive information required by their services for users that have opted-in to such services.

This short paper outlines the innovative and promising work that we are undertaking to improve the quality of mobile services. We are investigating algorithms and system architectures that will allow mobile service providers to implement services and operational support systems - both in the infrastructure and on the mobile device - that improve efficiency, reduce complexity, and increase customer experience in a multitude of ways. Typical one-off solutions for mobile services - though effective in isolation - tend to focus on single "verticals", such as automotive, or healthcare. Our work focuses upon challenges of creating middleware that offers rich context-aware event logic to address a spectrum of issues across many verticals. When successfully implemented, the benefits will include: more efficient operations for service providers and more interesting, seamless, context-aware services for mobile customers.

This paper describes a demo proposal involving a framework for event management and efficient and intelligent processing. The framework enables value-adding services to be created and several of these innovative services - in prototype status -will be shown.

Presents READY, a multi-threaded implementation of the CORBA Notification Service. The main contribution of our work is the design and development of scalable solutions for the implementation of the CORBA Notification Service. In particular, we present the overall architecture of READY, discuss the key design challenges and choices we made with respect to filter evaluation and event dispatching, and present the current implementation status. Finally, we present preliminary experimental results from our current implementation.

READY is an event notification service that provides efficient, decoupled, and asynchronous event notifications. READY supports: consumer specifications that match over single and compound event patterns; communication sessions that manage quality of service for event delivery; grouping constructs for sessions and specifications; and event zones and boundary routers that bound the scope of event distribution and control the mapping of events across zones.

Proposes logging and recovery algorithms for distributed architectures that use local disk space to provide transactional facilities locally. Each node has its own log file where all log records for updates to locally cached pages are written. Transaction rollback and node crash recovery are handled exclusively by each node and log files are not merged at any time. Our algorithms do not require any form of time synchronization between nodes and nodes can take checkpoints independently of each other. Finally, our algorithms make possible a new paradigm for distributed transaction management that has the potential to exploit all available resources and improve scalability and performance.

The Prospector Multimedia Object Manager prototype is a general-purpose content analysis multimedia server designed for massively parallel processor environments. Prospector defines and manipulates user defined functions which are invoked in parallel to analyze/manipulate the contents of multimedia objects. Several computationally intensive applications of this technology based on large persistent datasets include: fingerprint matching, signature verification, face recognition, and speech recognition/translation [OIS96].

The Teradata Multimedia Object Manager is a general-purpose content analysis multimedia server designed for symmetric multiprocessing and massively parallel processing environments. The Multimedia Object Manager defines and manipulates user-defined functions (UDFs), which are invoked in parallel to analyze or manipulate the contents of multimedia objects. Several computationally intensive applications of this technology, which use large persistent datasets, include fingerprint matching, signature verification, face recognition, and speech recognition/translation.

Presents the architecture of /spl Bscr/eSS (Bell Laboratories Storage System)-a high-performance configurable database storage manager providing key facilities for the fast development of object-oriented, relational or home-grown database management systems. /spl Bscr/eSS is based on a multi-client multi-server architecture offering distributed transaction management facilities and extensible support for persistence. We present some novel aspects of the /spl Bscr/eSS architecture, including a fast object reference technique that allows re-organization of databases without affecting existing references, and two operation modes that an application running on a client or server machine can use to interact with the storage system-(i) copy on access and (ii) shared memory.>

The paper describes the client-server software architecture of the EOS storage manager and the concurrency control and recovery mechanisms it employs. Unlike most client-server storage systems that use the standard two-phase locking protocol, EOS offers a semi-optimistic locking scheme based on a multigranularity two-version two-phase locking protocol. Under this scheme, many readers are allowed to access a data item while it is being updated by a single writer. For recovery, EOS maintains a write-ahead redo-only log because of the potential benefits it offers in a client-server environment. First, there are no undo records, as log records of aborted transactions are never inserted in the log; this minimizes the I/O and network transfer costs associated with logging during normal transaction execution. Secondly, it reduces the space required for the log. Thirdly, it facilitates fast recovery from system crashes because only one forward scan of the log is required for installing the updates performed by transactions that committed prior to the crash. Performance results of the EOS recovery subsystem are also presented.>

No abstract available.