Abstract: An initial sequence of one or more symbols is received via a user interface. An attempt is made to send a request for online suggestions to a network server via a communication network, the request including at least one symbol in the initial sequence. When the initial sequence is less than n symbols long, and if no response to the request is received, the initial sequence is displayed without generating offline suggestions. When the initial sequence is at least n symbols long, and if no response to the request is received within a predetermined period of time, offline suggestions consistent with the initial sequence are generated using offline geospatial data stored in the computing device, and the offline suggestions are provided via the user interface.

Abstract: In one embodiment, a method includes accessing a social graph by a social-networking system. The social graph includes a plurality of nodes and a plurality of edges connecting the nodes. The social-networking system may receive a trigger action from a first user. In response to the trigger action, the social-networking system may generate reaction-cards based at least in part on the trigger action where each reaction-card is associated with a structured query referencing nodes and edges of the social graph. The social-networking system may calculate a reaction-card score for each reaction-card, where the reaction-card score is based on a relevance of the structured query associated with the reaction-card to the trigger action and user-engagement factors. The social-networking system may then send each reaction-card having a reaction-card score greater than a threshold reaction-card score to the first user for display on a page currently accessed by the first user.

Abstract: On-chart data filtering on computing devices such as, e.g., touch-enabled mobile devices can be enabled by methods, systems, and computer programs that facilitate detecting a filtering gesture performed on an axis element (such as a value range, category label, or category-label row) of a data chart displayed on-screen and, in response to the filtering gesture, filtering data associated with the axis element and updating the displayed data chart based on the filtering.

Abstract: An apparatus comprises an object store, back-end storage supporting the object store, and a file system associated with the back-end storage. Objects of the object store are mapped to files of the file system. The file system is configured to provide file system metadata extensions for respective ones of the files, with the file system metadata extension for a given one of the files comprising a plurality of sets of attributes characterizing respective ones of a plurality of accesses to the given file. The file system metadata extension for the given one of the files may be updated responsive to each of the plurality of accesses to that file to incorporate a corresponding one of the sets of attributes. Each of the sets of attributes may comprise, for example, at least one time-based attribute and at least one data integrity check attribute.

Abstract: Various embodiments for managing data in a data storage having data deduplication. In response to a portion of the data storage determined to be inaccessible, an identifier of a user data segment is queried by examining a corresponding back reference data structure, the back reference data structure implemented as an approximation of a relationship between the user data segment and a particular storage block in the data storage. If the outcome of the query is negative, the user data segment is determined not associated with the particular storage block. If the outcome of the query is positive, the user data segment is warranted be examined further to determine if the user data segment is associated with the particular storage block.

Abstract: Systems and methods consistent with various disclosed embodiments provide for managing and collaborating information over a computer network. In one embodiment, a system is disclosed for managing documents over a network. The system may include a storage device and one or more processors. The processor(s) may receive a first version of a document from a client. The processor(s) may create, in a document log, an entry associated with the first version of the document. The processor(s) may receive a request from a remote computer that is displaying in an interface a second version of the document, and the request may include a request for information from one or more entries in the document log. The processor(s) may provide to the remote computer, for displaying in a display window in the interface, information from one or more entries in the document log.

Abstract: Methods, systems and programming for providing query suggestions based on user's previous search query. In one example, an input including a prefix of a first query is received from a user in a user session. At least a second query that was previously received from the user in the user session is then obtained. A third query is obtained based on the second query and the prefix of the first query. One or more query suggestions are provided to the user as a response to the input. The one or more query suggestions include the third query.

Abstract: Various embodiments for managing data in a data storage having data deduplication. A back reference data structure is configured for user data segments as a mechanism to identify an affected storage block to which information in the back reference data structure refers. The back reference data structure is initialized such that a resolution of the back reference data structure diminishes as a number of the user data segments referencing the affected storage block increases.

Abstract: Various embodiments for managing data in a data storage having data deduplication. For a back reference data structure incorporating reference information for at least one user data segment to a storage block, using a plurality of hash functions to convert between a plurality of form types of user data segment identification (ID's) representative of the at least one user data segment.

Abstract: Various embodiments herein each include at least one of systems, methods, and software for in memory data warehouse planning and broadcasting. Some embodiments include an in memory database having a set of define database table views that provide a virtual data model upon which services execute for various purposes including planning, simulation, and broadcasting of generated reports and other document. These services are executed within a computing environment of the in memory database and can be configured and grouped into applications and processes. Such embodiments eliminate system performance bottlenecks and provide a platform upon which “extreme” application performance can be obtained.

Abstract: A method of generating search trees (25, 27) indicating next valid characters for an input interface of a navigation device includes determining a search sub-tree (29) which indicates next valid characters for both a subset of a first set of character strings and for a different second set of character strings. A first search tree (25) is generated based on information on the first set of character strings, and a second search tree (27) is generated based on information on the second set of character strings. The first search tree (25) is generated such that a node (26) of the first search tree (25) references the search sub-tree (29). The second search tree (27) is generated such that another node (28) of the second search tree (27) references the search sub-tree (29).

Abstract: Searching a service registry system including a plurality of services identified by respective service names, wherein at least some of said service names being associated with a set of client identifiers, includes receiving a search request, said request including a service name and a further set of client identifiers, searching, using a processor, the service registry system for a match between the requested service name and a service name of one of said services in the service registry system, and, in the absence of such a match, searching, using the processor, the service registry system for services that have an association with at least some of the client identifiers in said further set. A search result can be returned.

Abstract: Total global minimum costs can be determined for multiple sub-plans for completing a multi-operation database process to be performed in a distributed database management system that includes a plurality of nodes. The multiple sub-plans can include different distributions of node locations of a plurality of operators among the plurality of nodes. An optimal plan having a lowest total minimum global cost can be selected from the multiple sub-plans.

Abstract: Systems and methods of providing content for display on a computing device via a computer network using a location feature index are provided. A data processing system can receive a request for content from the computing device, and can determine a geographic location of the computing device associated with the request for content. The data processing system can identify a keyword indicating a non-geographic semantic feature of the determined geographic location. The identification can be based on the determined geographic location and from a location feature index that maps geographic areas to keywords that indicate non-geographic semantic features of the geographic areas. The data processing system can select, based on the keyword, a candidate content item for display on the computing device.

Abstract: A method includes generating data from workforce applications, at least one of the workforce applications including at least one of forecasting, scheduling, recording, and monitoring functionalities; and storing the data from the at least one of the workforce applications in a storage area network (SAN), the SAN being operable to connect the at least one of the workforce applications to computer storage devices. This may also include keeping recorded contacts in a long term storage device such as the SAN or an operational data store (ODS) and transparently searching in both the ODS and the SAN simultaneously. With a concept of moving data on to a file system SAN which is cheaper as compared to a database technology such as ODS, the method facilitates predictable performance from the ODS and easier manageability with constant cost from SAN.

Abstract: Methods, systems, and apparatus include computer programs encoded on a computer-readable storage medium, including a method for providing content. A query is received. Search results are identified that are responsive to the query. A content item is identified for presentation along with the search results. It is determined, based on one or more criteria, when the content item is to be augmented. When it is determined that the content item is to be augmented and after identifying the search results, the content item is augmented based at least in part on an entry in the search result. An augmented content item is created. The augmented content item is provided.

Abstract: Among other things, one or more techniques and/or systems are provided for facilitating the completion of a user task. That is, user intent (e.g., intentions of a user to perform a user task) may be identified. The user intent may comprise an entity (e.g., a movie entity) and/or an action (e.g., an order movie tickets action) that the user wants to perform on the entity. A provider list may be created based upon one or more providers capable of performing the action on the entity (e.g., a movie application may be capable of performing the order movie tickets action on the movie entity). Providers may be dynamically selected for inclusion within the provider list at run-time. For example, an open market of providers may be maintained (e.g., providers may be added, removed, and/or updated over time), such that providers may be selected from the open market to complete user tasks.

Abstract: Data that includes a query of a temporal database is received from a remote application server. The query specifies at least one fact and a system time and an application time for the at least one fact. Thereafter, a bitemporal timeline index is accessed to identify data responsive to the query. The bitemporal timeline index includes a system time dimension and an application time dimension. Next, the identified data can be retrieved and provided to the remote application server. Related apparatus, systems, techniques and articles are also described.

Abstract: A sparse file is stored without holes by storing a data portion of the sparse file using a parallel log-structured file system; and generating an index entry for the data portion, the index entry comprising a logical offset, physical offset and length of the data portion. The holes can be restored to the sparse file upon a reading of the sparse file. The data portion can be stored at a logical end of the sparse file. Additional storage efficiency can optionally be achieved by (i) detecting a write pattern for a plurality of the data portions and generating a single patterned index entry for the plurality of the patterned data portions; and/or (ii) storing the patterned index entries for a plurality of the sparse files in a single directory, wherein each entry in the single directory comprises an identifier of a corresponding sparse file.

Abstract: System, method and computer program products for probing a hash table by receiving a compressed input key, computing a hash value for the compressed input key and probing one or more buckets in a hash table for a match. Each bucket includes multiple chunks. For a bucket in the hash table, chunks are searched in that bucket by comparing in parallel the hash value with multiple slots in each chunk, such that if a value in a chunk equals the hash value of the compressed input key, then a match is declared and a vector is returned with a significant bit of a matching slot in the bucket set to a value. If a value stored in a chunk corresponds to an empty slot, then a mismatch is declared, and the vector is returned as the result with the significant bit of a matching empty slot set to the value.