Apple Inc.

Amol V Pattekar

Jeremy Matthew Werner

Derrick Huhn

Richard Frederick Wagner

Nicholas K Puz

Olivier Bonnet

Kenneth Buffalo McNeil

James Callender

Augustin J Farrugia

Joe S Abuan

Mathieu Ciet

Gianpaolo Fasoli

Yan Yang

Berkat S Tung

Andrew H Vyrros

Patrick G Gates

Benoit Chevallier-Mames

Gokul P Thirumalai

Julien Lerouge

Thomas P Devanneaux

Eric Daniel Friedman

Ritwik K Kumar

Christina Elizabeth Warren

Lucas Olen Winstrom

Daniel T Kurtz

Kevin R Lafferty

Nathan Taylor

Onar Vikingstad

Mitchell B Rivera

Paul A Seligman

Liam Weiner

Aleksei Naiden

Jeremy M Stober

Jessica S Cheng

Samir Bajaj

Establishing a communication channel via a relay server with reduced setup time. Upon request by an initiating communication device a relay allocation server may allocate a single relay server for use in a communication session between the initiating communication device and one or more recipient communication devices. The relay server may be selected to perform favorably for the initiating communication device. Messaging for establishment of the communication session may be performed using persistent messaging connections, to avoid connection establishment cost. Messaging may also be performed using address tokens to avoid the cost of discovering global IP addresses. Following establishment of the communication session, the relay server may discover the IP address of one or more recipient communication devices, and may initiate reallocation of those devices to another relay server.

Relayed communication channel establishment

A method of enabling applications to reference user information is provided, including receiving a request for a user identifier that references a user of the application and sending a second request for the user identifier to a server. The second request may include a second user identifier that references the user and a second authentication token for the second user identifier. Furthermore, the second user identifier and the second authentication token are not accessible by the user. The method includes receiving the user identifier and an authentication token for the first user identifier. The user identifier corresponds to the second identifier; and providing the user identifier and authentication token to the application. A method of enabling an application to identify users associated with a user of the application is provided; the method may include receiving, from the server, user identifiers that reference one or more users scoped to the application.

Methods and systems for single sign-on while protecting user privacy

Systems and methods are described for rate-limiting a message-sending client interacting with a message service based on dynamically calculated risk assessments of the probability that the client is, or is not, a sender of a spam messages. The message service sends a proof of work problem to a sending client device with a difficulty level that is related to a risk assessment that the client is a sender of spam messages. The message system limits the rate at which a known or suspected spammer can send messages by giving the known or suspected spammer client harder proof of work problems to solve, while minimizing the burden on normal users of the message system by given them easier proof of work problems to solve that can typically be solved by the client within the time that it takes to type a message.

Method for rate-limiting interactions based on dynamically calculated values by supplying problems of varying difficulty to be solved

A method of generating a schema including receiving a data record having a record type name and one or more data values is provided. The data values are associated with data value names. The method includes determining whether a set of existing schemas includes a schema associated with the record type name, determining whether the schema includes an element having the same name as a corresponding data element of the record, and validating the corresponding data element against the schema element. A new schema element is added to the schema, the new schema element having the same name and type as the corresponding data element of the record. The method can further include indexing at least one of the one or more data values, which involves querying the indexed data, forming subscription lists for the data values, and forming a derived data value associated with one or more data values.

Methods and systems for record editing in application development

Techniques are disclosed for delivering push subscription notifications in large scale distributed systems. Subscription notifications can be delivered to mobile devices of subscribing users by monitoring, at a server, an application database comprising a data record having one or more data values, detecting, at the server, in accordance with the monitoring, a changed data value, querying a subscription database for a subscription having at least one constant value to be compared to the changed data value in accordance with a trigger condition specified in a trigger template, determining whether the trigger condition is true using the changed data value and the constant value as the values of the first and second variables, respectively, in the at least one comparison; and pushing a notification from the server in response to the trigger condition being true.

Push subscriptions

Disclosed herein is a technique for providing status feedback on the execution of a database request. The technique involves receiving a database request that defines an operation to be performed on at least one data record stored in a database. The data record is updated in the database in accordance with the operation, and one or more tasks that are to be performed in connection to the operation are scheduled for execution. A first version of a receipt is generated and provided to the application, and includes, for each of the one or more tasks, a status field that indicates a progress of executing the task. The method further includes the steps of, in response to a change in the execution of any of the one or more tasks, updating the status fields to produce a second version of the receipt, which is then provided to the application.

Method for issuing multipart receipts in connection to extensive database operations

A method of implementing challenges in single-player games starts with a server receiving a challenge from a first mobile device and transmitting the challenge to a second mobile device. The challenge may include a high score or an achievement of a single-player game obtained on the first mobile device. The server may determine that a new high score is obtained on the second mobile device that is equal or greater than the high score included in the challenge or that the achievement is completed on the second mobile device. The server may then transmit a notification to the first mobile device that the challenge has been completed. If the server determines that the new high score is obtained, the notification may include a new challenge from the second mobile device to the first mobile device and the new challenge may include the new high score. Other embodiments are also described.

Implementing challenges in single-player games

An apparatus, method, and machine-readable medium are described for managing data within a friend service. In one embodiment, a key/value data store can be used to provide an efficient and highly-scalable friend service database. Various techniques can be used to ensure data consistency between friend service data records. For example, in one embodiment, operations are detected which require updates to a plurality of related friend state records. A key may be generated to represent each of the operations and then used to create an entry in a write-ahead log database. In one embodiment, each entry in the write-ahead log database may specify the operation to be performed on the friend state records. If the plurality of friend state records are successfully updated, then the entry in the write-ahead log database may be deleted. However, if the plurality of friend state records are not successfully completed, then the entry is not deleted from the write-ahead log database. The friend state records associated with old entries in the write-ahead log database are checked for consistency and inconsistent records are repaired. In addition, optimistic locking techniques may be used in one embodiment to improve performance of the friend service database.

Apparatus and method for efficiently managing data in a social networking service

Growing community of inventors

San Jose, CA, United States of America

Amol V Pattekar