Abstract: The present disclosure provides a method for ordering comments, and apparatus, device and computer storage medium thereof, which relates to the technical field of 5 big data. A specific implementation solution is as follows: obtaining comments data, ordering the comments based on basic attributes of the comment to obtain a first ordering result, and establishing an index for the first ordering result; in response to obtaining an event of the user triggering display of the comments, obtaining the first ordering result through the index, and performing ordering adjustment on the first 10 ordering result based on the user's feature data to obtain a second ordering result which serves as a basis for displaying the comments to the user. The present disclosure can meet the user's personalized needs for comment ordering.

Abstract: Introduced are systems and methods that enable modification of logs in multiple off-line databases. Multiple off-line devices can mistakenly associate different respondents with the same identification (ID) unique to the system. When the multiple off-line devices synchronize with each other, or synchronize with a server hosting the central database, the software running on the off-line devices, or on the server detects that the modified logs come from different respondents, and the software assigns two different IDs unique to system to the logs. In another embodiment, multiple off-line devices can mistakenly associate the same respondent with two different IDs unique to the system. When the multiple off-line devices synchronize with each other or with the server, the software running on the off-line devices, or the server detects that the modified logs come from the same respondent, and the software assigns the logs to the same ID unique to system.

Abstract: A system for providing a search service is disclosed and includes a processor-based search service application builder component that provides a search model representing a search service application for a first object of a plurality of objects. The search model is based at least on a user-defined end-user input field corresponding to a first attribute of a plurality of attributes associated with the first object and a user-defined search result output field corresponding to a second attribute of the plurality of attributes. The search model is also associated with a backend data store that supports a storage structure configured to store information relating to the first object. The system also includes a processor-based deployment engine that automatically configures a search engine system associated with the backend data store system to generate and/or update search index(es) based on at least one of the first attribute and the second attribute.

Abstract: A non-transitory, computer-readable recording medium stores therein a response processing program that causes a computer to present, based on question data and information associating answer data, the answer data related to input question data. The response processing program causes the computer to execute a process including referring to a storage storing therein a response result for past question data input in the past, and displaying poorly resolved question data for which a related answer is not identified or a presented answer has been negatively evaluated; and setting specified poorly resolved question data among the displayed poorly resolved question data, as object question data for which information associating answer data is additionally registered. The displayed poorly resolved question data is displayed as priority question data having higher priority a greater is a poor resolution occurrence number thereof.

Abstract: A method is performed at a computing device that includes a display, one or more processors, and memory. The device displays a data visualization based on a dataset retrieved from a database. It also displays one or more phrases in a first region. The phrases define the data visualization. The device receives user input in a second region to specify a natural language command related to the displayed data visualization. In response to the user input, the device extracts independent analytic phrases from the command, determines one or more proposed actions based on the extracted phrases, and displays the proposed actions. The device receives user selection of a first proposed action. In response, the device generates an updated data visualization. It displays the updated data visualization and displays one or more updated phrases in the first region. The updated phrases define the updated data visualization.

Abstract: The present technology proposes techniques for ensuring globally consistent transactions. This technology may allow distributed systems to ensure the causal order of read and write transactions across different partitions of a distributed database. By assigning causally generated timestamps to the transactions based on one or more globally coherent time services, the timestamps can be used to preserve and represent the causal order of the transactions in the distributed system. In this regard, certain transactions may wait for a period of time after choosing a timestamp in order to delay the start of any second transaction that might depend on it. The wait may ensure that the effects of the first transaction are not made visible until its timestamp is guaranteed to be in the past. This may ensure that a consistent snapshot of the distributed database can be determined for any past timestamp.

Abstract: Example embodiments facilitate creation of efficient tree structures (and strategic modification of and manipulation of existing tree structures), such that the resulting tree structures enable rapid computing operations, including, but not limited to, rapid relational set operations (e.g., joining trees, comparing tree structures, determining structural similarities of trees, adding tree nodes, removing or replacing tree nodes, accessing tree data, updating tree data, and so on). An example method relates to a method and/or system for creating and manipulating tree data structures (also simply called trees herein) as, for example, in relational databases. One embodiment uses compact bit-wise path encoding that stores structural data related to tree branches to which a current node belongs.

Abstract: The Variable Data Source Dynamic and Automatic Ingestion and Auditing Platform Apparatuses, Methods and Systems (“DIAP”) transforms file upload request, external data request, and analytics request inputs via DIAP components into clean data, metadata data sets, visualization module output, and audit notification outputs. A data ingest request is obtained via a user interface. A data file to ingest is obtained and processed to generate a clean file. A database table with a unique name is created and data in the clean file loaded into the database table. A metadata data set identifier is generated. Table columns from the database table to include into the metadata data set are determined, and the metadata data set is generated. The metadata data set links columns from the database table to analytics engine UI elements, and columns are associated with audit trail data via the metadata data set identifier.

Abstract: Systems and methods for searching digital content are disclosed. A method includes receiving, from a user, a base search constraint. A search constraint includes search values or criteria. A recall set is generated based on the base search constraint. Recommended search constraints are determined and provided to the user. The recommended search constraints are statistically associated with the base search constraint. The method receives, from the user, a selection of a first search constraint included in the plurality of recommend search constraints. The method generates and provides search results to the user that include a re-ordering of the recall set. The re-ordering is based on a search constraint set that includes both the base search constraint and the selected first search constraint. The re-ordering is further based on a weight associated with the base search constraint and another user-provided weight associated with the first search constraint.

Abstract: In general, metadata is stored in a data storage system. Summary data identifying one or more characteristics of each of multiple metadata objects stored in the data storage system is computed, and the summary data characterizing a given metadata object in association with the given metadata object is stored. A visual representation is generated of a diagram including nodes representing respective metadata objects and relationships among the nodes. Generating the visual representation includes superimposing a representation of a characteristic identified by the summary data characterizing a given metadata object in proximity to the node representing the given metadata object.

Abstract: A data processor for transferring or maintaining a data sample, includes: a table management unit that manages a data value table that relates a data type of the data sample, usage attribute information defined by a pair of at least one attribute type and a value concerning a utilization form, and information for defining a value index; and a prioritizing unit that defines the value index for the data sample based on the data value table, the value index belonging to a specific data type and associated with the usage attribute information, and sets a priority of the transferring or the maintaining of the data sample using the value index.

Abstract: A system and method of indexing documents to support frequent field updates without reindexing may include receiving, from an indexing application, first fields from a document to be indexed. The method may also include receiving, from the indexing application, second fields from the document to be indexed. The first fields are to an index file associated with the indexing application. The index file comprises a directory wrapper around at least a portion of a file system for the indexing application, wherein the wrapper (i) provides indications of when the in-memory file is flushed to the file system, and (ii) controls synchronization of the file system and a data store. The method may further include writing the second fields to a reverse index.

Abstract: Disclosed is an improved approach for implementing and maintaining writable snapshots. An efficient approach is provided for implementing snapshots that can be used to immediately create snapshots without incurring any detectable delays in providing access to the new snapshots. Also described are improved metadata structures that can be used to implement and maintain the writable snapshots.

Abstract: Methods, systems, and computer program products are provided for presenting content in accordance with a placement designation. One example method includes identifying terms associated with a campaign, the campaign having an associated content item that is presented to users responsive to requests for content, receiving an indication of a placement designation including targeting criteria for presenting the content item in a search suggestion control along with search suggestions, storing information associated with the campaign, and processing content requests.

Abstract: Methods, apparatus, systems, and computer-readable media are provided for automatically augmenting message exchange threads based on a detected tone of messages exchanged between participants. In various implementations, a message contributed to a message exchange thread involving one or more message exchange clients by a participant may be determined. In various implementations, an idle chatter score associated with the message may be calculated. In various implementations, either a conversational response to the message or content responsive to a search query generated based on the message may be selectively incorporated into the message exchange thread based at least in part on the idle chatter score. In some implementations, a search query suitability score associated with the message may also be calculated.

Abstract: The subject technology determines a number of execution nodes to execute a task. The subject technology determines that no virtual warehouse from a pool of virtual warehouses includes at least the number of execution nodes. The subject technology generates a new virtual warehouse including at least the number of execution nodes. The subject technology determines whether a previous execution of a prior task was completed in less than a threshold time period of a time interval, the time interval corresponding to a particular period of time for executing at least one task. The subject technology increments a score corresponding to a size of a particular virtual warehouse. The subject technology selects the new virtual warehouse from the pool of virtual warehouses based at least in part on the incremented score and the number of execution nodes included in the selected new virtual warehouse.

Abstract: A method of content delivery in a content delivery network (CDN), where the CDN is deployed, operated and managed by a content delivery network service provider (CDNSP). The CDN comprises a set of content servers and a domain name system (DNS). For a given content provider, a determination is first made whether the content provider has “cold content” delivery requirements by evaluating one or more factors that include: total content size, size of content objects expected to be served, uniqueness of content, total number of content objects, and a percentage of the total content size that is expected to account for a given percentage of traffic. Upon a determination that the content provider has cold content delivery requirements, a subset of the CDN content servers are configured to implement a set of one or handling rules for managing delivery of the cold content from the CDN content servers.

Abstract: A method includes a computing device receiving a sort request regarding data of a table. The method further includes the computing device determining probability traits of the data. The method further includes the computing device dividing the sort request into sub-sort requests based on the probability traits. The method further includes the computing device identifying processing core resources to perform the sub-sort requests based on the probability traits. The method further includes the computing device allocating the sub-sort requests to the identified processing core resources in accordance with the probability traits. The method further includes the computing device allocating data portions to the identified processing core resources in accordance with the probability traits. The method further includes the computing core resources executing allocated sub-sort requests on corresponding divided data portions to produce sorted data portions.

Abstract: Methods, apparatus, systems, and computer-readable media are provided for automatically augmenting message exchange threads based on a detected tone of messages exchanged between participants. In various implementations, a message contributed to a message exchange thread involving one or more message exchange clients by a participant may be determined. In various implementations, an idle chatter score associated with the message may be calculated. In various implementations, either a conversational response to the message or content responsive to a search query generated based on the message may be selectively incorporated into the message exchange thread based at least in part on the idle chatter score. In some implementations, a search query suitability score associated with the message may also be calculated.

Abstract: There is provided a system including a non-transitory memory storing an executable code and a hardware processor executing the executable code to receive an input sentence including a first predicate and at least a first argument depending from the first predicate, identify the first predicate, identify the first argument based on the first predicate, apply a dependency multiplication to determine a semantic role of the first argument based on the first predicate, and assign the first argument to an argument cluster including one or more similar arguments based on the semantic role of the first argument.