Abstract: A facility for adjusting a display of a result of searching a property database is described. The facility, after displaying a list of properties satisfying a search filter, allows a user to specify property attributes the values of which are not currently shown for the properties, and redisplays the list of properties by additionally showing the values of those property attributes for the properties.

Abstract: A system and method to manage data associated with a merchant system to provide in response to a search query from an end user system. The system and method generate a custom entity type including one or more fields comprising first data corresponding to the merchant system. An update to the first data of the custom entity type can be received and an updated custom entity type is generated. The updated custom entity type is distributed to multiple business listing provider systems configured to provide search results associated with the merchant system in response to a search query from an end user system. The system and method can also generate a search experience interface including multiple input fields. The search experience interface is displayed to an end user to receive search terms via the first input and the second input field in response to a single search action.

Abstract: A method of recommending content items includes obtaining vector representations of items based on a matrix of items versus item users that indicates item use by the users, reducing each of the vector representations to a two-dimensional space, creating clusters having cluster centers using one or more mixture models based on the reduced vector representations, using the cluster centers for one or more mixture models to create discrete categories to which items can be assigned and providing one or more recommendations to a first user based on the item assignments within the discrete categories.

Abstract: One or more servers receive a natural language query from a client device associated with a user. The one or more servers classify the natural language query as a query that seeks information previously accessed by the user. The one or more servers then obtain a response to the natural language query from one or more collections of documents, wherein each document in the one or more collections of documents was previously accessed by the user. The one or more servers generate search results based on the response. Then, the one or more servers communicate the search results to the client device.

Abstract: A method, system, and processor-readable storage medium are directed towards generating a report derived from data, such as event data, stored on a plurality of distributed nodes. In one embodiment the analysis is generated using a “divide and conquer” algorithm, such that each distributed node analyzes locally stored event data while an aggregating node combines these analysis results to generate the report. In one embodiment, each distributed node also transmits a list of event data references associated with the analysis result to the aggregating node. The aggregating node may then generate a global ordered list of data references based on the list of event data references received from each distributed node. Subsequently, in response to a user selection of a range of global event data, the report may dynamically retrieve event data from one or more distributed nodes for display according to the global order.

Abstract: Data placement and recovery technology for individually controlling a storage device includes a data management method that may achieve a power saving effect by distributing files between a portion of storage devices, for example, between storage devices included in a higher group and by limiting dependence according to a change in a state of the storage devices to be applied to a portion of storage devices to which a file distribution is performed.

Abstract: Pre-computed search results are re-computed by a computation platform based on available computing resources. A search platform maintains at least a first and a second group of pre-computed search results and provides the first group of pre-computed search results at a first provision time and the second group of pre-computed search results at a second provision time to requesting clients. A re-computation controller schedules the re-computation of the pre-computed search results on the basis of validity probabilities being associated with the pre-computed search results and the respective provision times. Re-computation of the first group and the second group is scheduled such that the validity of the search results of the first group given by the validity probabilities is maximized at the first provision time and the validity of the pre-computed search results of the second group given by the validity probabilities is maximized at the second provision time.

Abstract: Aspects of the present disclosure provide techniques for database documentation propagation. Embodiments include scanning a log comprising a plurality of database queries to identify one or more database queries of the plurality of database queries, the one or more database queries being associated with generating a new table of a database based on information in an existing table of the database. Embodiments include generating, based on the one or more database queries identified during the scanning, a directed acyclic graph (DAG) comprising: a first vertex representing the existing table; a second vertex representing the new table; and a directed edge connecting the first vertex to the second vertex. Embodiments include obtaining documentation associated with the existing table. Embodiments include propagating, based on the DAG, at least a subset of the documentation associated with the existing table to the new table.

Abstract: An approach for parallel deduplication using automatic chunk sizing. A dynamic chunk deduplicator receives a request to perform data deduplication where the request includes an identification of a dataset. The dynamic chunk deduplicator analyzes file level usage for one or more data files including the dataset to associate a deduplication chunk size with the one or more data files. The dynamic chunk deduplicator creates a collection of data segments from the dataset, based on the deduplication chunk size associated with the one or more data files. The dynamic chunk deduplicator creates a deduplication data chunk size plan where the deduplication data chunk size plan includes deduplication actions for the collection of data segments and outputs the deduplication data chunk size plan.

Abstract: It is presented a method for managing communication data. The method is performed by a connection manager server (20) and comprising the step of: causing store (41) of historical communication data, for a communication session between a user and one or more contacts, into a database (13), wherein the historical communication data comprises communication data, a session identifier, a communication type, a communication context, and a user identifier for each contact having participated in the communication session. Methods for indexing communication data, and for recommending a communication type, are also presented. Corresponding connection manager servers (20), computer programs (64, 65) and a computer program product (62, 63) are also presented.

Abstract: Methods, systems, and computer storage media for providing reduced-latency data operations in a file system. In operation, a request to perform a data operation associated with a B+ table storage of a file system is received. The file system supports the B+ table storage that is accessible using a B+ tree lookup logic for accessing B+ table data and supports a cache storage that is accessible using a cache table lookup logic for accessing cache data in the cache storage. A number of references to the location in the B+ table storage is determined. The location in the B+ table storage is associated with the request to perform the data operation. Based on determining the number of references to the location, a cache storage location to perform the data operation is accessed. The cache storage location is mapped (using the cache table) to the location in the B+ table storage.

Abstract: A query referencing an external table function provided by a remote software component is received. Requests to execute the external table function on input data are sent to a proxy service. A first request includes a batch of input rows from the input data. A first response to the first request received from the proxy service includes a first portion of result data and a pagination token. The pagination token indicates that at least a second portion of the result data corresponding to the first batch of input rows is to be obtained from the remote software component. Based on the pagination token, a second request is sent to obtain the second portion of the result data. One or more responses are received from the proxy service that comprise at least the second portion of the result data. The result data is processed according to the query.

Abstract: A transaction is identified in a transaction processing system. An identifier value is generated for the transaction based on a concatenation of a unique sequence value and an identifier offset value. The transaction is processed by using the identifier value as a database primary key in a database of the transaction processing system.

Abstract: Examples provide a network component, a network switch, a central office, a base station, a data storage element, a method, an apparatus, a computer program, a machine readable storage, and a machine readable medium. A network component (10) is configured to manage data consistency among two or more data storage elements (20, 30) in a network (40). The network component (10) comprises one or more interfaces (12) configured to register information on the two or more data storage elements (20, 30) comprising the data, information on a temporal range for the data consistency, and information on one or more address spaces at the two or more data storage elements (20, 30) to address the data.

Abstract: Disclosed herein are systems and methods for classifying unstructured datasets according to a classification system and generating an enhanced, classified and structured data-set enabling efficient supplemental computer-based processing. The exemplary computer-implemented classification algorithms involve, for each entry in the input dataset, semantically interpreting a text-based occupation description, analyzing the description according to an ontology of interrelated “concepts” and identifying semantically relevant concept(s) and any associated descriptors specific to the classification system. The system is also configured to expand the list of relevant concepts to include concepts that bear a relationship thereto, scoring the various concepts and associated descriptors and identifying the concept(s) and descriptors that most accurately correspond to the input data.

Abstract: A method for more intelligently managing storage space in journal volumes is disclosed herein. In one embodiment, such a method includes maintaining, on a primary storage system, a change recording data structure that documents updated storage elements of a primary volume on the primary storage system. The method further determines in which extents of the primary volume the updated storage elements reside. These extents are recorded in an extent-based data structure. The method transmits the extent-based data structure from the primary storage system to a secondary storage system that is in an asynchronous mirroring relationship with the primary storage system. The extent-based data structure is then read at the secondary storage system. The method frees, from a journal volume on the secondary storage system, extents that are not recorded in the extent-based data structure. A corresponding system and computer program product are also disclosed herein.

Abstract: A method may include receiving input effective to select a visualization type of multiple different visualization types to apply to a visualization of data. The selected visualization type may be associated with a contract. Each of the different visualization types may be associated with a specific contract. Each contract may include a corresponding schema that specifies a set of data fields and one or more relationships between data fields in the set to generate and display a corresponding visualization having a visualization type. The method may include mapping at least some data of a data source to the contract such that the contract is satisfied. The contract may specify that the data of the data source be in a graph format. The method may include displaying the visualization of the at least some data of the data source based on the contract, the displayed visualization having the selected visualization type.

Abstract: The technology disclosed herein may enable ranking comments based on the influence of the author. An example method may involve obtaining a plurality of comments associated with a media item, wherein the media item is provided by a first entity and at least one of the plurality of comments is provided by a second entity; determining, by a processing device, an attribution score of the second entity, the attribution score being based on a number of entities that engage with the media item using a sharing message of the second entity; determining, by the processing device, rankings for one or more of the plurality of comments based on the attribution score of the second entity; and providing the media item and at least a first comment and a second comment of the plurality of comments to be displayed in an order based on the rankings.

Abstract: A method, system, and program product for enabling multiple source database coherency is provided. The method includes detecting an incoming query to be executed with respect to an accelerator server. An initial timestamp of the incoming query is analyzed and additional timestamps of database tables referenced by the incoming query are retrieved. It is determined that each timestamp of the additional timestamps is reached with respect to a corresponding replication engine and target data from the database tables is synchronized with source data of a source database. In response, the incoming query is accelerated for execution with respect to a target database management system.

Abstract: Discloses are a data clustering apparatus and method based on a range query using a CF tree. The data clustering apparatus includes a CF tree construction unit configured to construct a CF tree, including a leaf node configured with a micro cluster (MC) and an index node configured with a sub-cluster (SC), based on a plurality of data included in a data set, a micro cluster segment (MCS) generation unit configured to generate an MCS based on a distance between the MCs while sequentially searching the leaf node to a right, and a cluster set generation unit configured to generate a cluster set by performing a range query on the MCS.