Abstract: A hash code-based search apparatus includes a token set extracting unit configured to extract a token set having at least one token from a document, a hash code generating unit configured to generate N hash codes by applying N hash functions to the at least one token (where N is a natural number), and an index generating unit configured to generate a search index by indexing the document with the N hash codes.

Abstract: A system for modifying a website or interactive application, including a published database accessible via an end user data service to present the most up to date version of objects of the website, viewable and editable by at least one user, a draft database accessible via a designer data service and viewable and editable by at least one designer to store edits to the objects of the published database; a published database request handler to coordinate concurrent viewing and updating of the objects between the end user data service and the published database and a draft database request handler to coordinate concurrent viewing, editing and updating of the objects between the designer data service and the draft database and to merge edits and updates to the objects in both the published database and the draft database and to return the merged version of the objects without modifying the published database.

Abstract: The current invention relates to a computer-implemented method for determining a category of a request provided by a user by means of a user device; said user device comprising connection means and means for receiving a request description relating to said request from said user; the method comprising a plurality of steps among which: receiving, from said user, said request description, by means of said device; uploading said request description to a server, said server having access to a database comprising a plurality of previously categorized requests each comprising a category and a vocabulary comprising a plurality of word vector representations; identifying, by said server, a plurality of component words belonging to a natural language text string comprised in said request description; obtaining, for at least one of said plurality of component words, an associated word vector representation from said vocabulary; and determining a request vector, based on said at least one obtained word vector representa

Abstract: A visual data operation method, system, and device, and a medium for one or more pieces of data, creating one or more corresponding value objects, and arranging the one or more value objects as a tree structure; and for the one or more value objects, creating corresponding database records, and defining fields of the database records by the one or more value objects. Data and database records correspond to each other and are mutually converted by using value objects. A developer only needs to arrange the value objects as a tree structure, and a system can automatically complete remaining data operations subsequently, including creating database records and synchronizing database records, and the like. A developer can quickly design a data storage format by taking a user as a unit, and the design presentation is intuitive and understandable to other developers.

Abstract: Various embodiments for a triple integration and querying system are described herein. An embodiment operates by identifying a plurality of triples corresponding to a knowledge graph, and generating a table in a database into which to import the set of triples. The table includes a subject column, a predicate column, and multiple object columns across different datatypes. Values from the triples of the knowledge graph are loaded into the table and a query is executed on the table.

Abstract: Intelligent query routing may be performed across shards of a scalable database table. A router of a database system may receive an access request directed to one or more database tables. The router may evaluate the access request with respect to metadata obtained for the database tables to determine an assignment distribution of computing resources of the database system to data that can satisfy the access request. The router can select planning locations to perform the access request based on the assignment distribution of the computing resources. The router can cause the access request to be performed according to planning at the selected planning locations.

Abstract: Methods and apparatus consistent with the invention provide the ability to organize, index, search, and present time series data based on searches. Time series data are sequences of time stamped records occurring in one or more usually continuous streams, representing some type of activity. In one embodiment, time series data is stored as discrete events time stamps. A search is received and relevant event information is retrieved based in whole or in part on the time stamp, a keyword indexing mechanism, or statistical indices calculated at the time of the search.

Abstract: Techniques for implementing an orchestration service for data replication are provided. In one technique, a recipe is stored that comprises (1) a set of configuration parameters and (2) executable logic, for a data replication operation, that comprises multiple sub-steps. Each sub-step corresponds to one or more configuration parameters in the set of configuration parameters, which includes a first parameter that is associated with a default value and a second parameter that is not so associated. User input that specifies a value for the second parameter is received. The set of configuration parameters is updated to associate the value with the second parameter. The data replication operation is then initiated by processing the executable logic, which processing comprises, for each sub-step of one or more sub-steps, making an API call to a data replication service. In response to each API call, a response is received from the data replication service.

Abstract: Systems and methods for geographically distributed node replication include a first node which receives a message from a client based on a proximity of the first node to the client, the message transmitted to the first node via anycast routing from the client. The first node may replicate the message to a first subset of the geographically distributed system of nodes based on a geographic proximity of nodes within the first subset. The first node may publish the message to a data feed of a message bus for the system of nodes, to cause at least one node of the system of nodes to receive the message from the first node, the at least one node outside the first subset and subscribing to the data feed of the first node.

Abstract: Methods, systems, and apparatus to constrain a search are described. A selection of one or more items of a search result set by a user may be obtained. One or more attributes of the one or more selected items may be evaluated. One or more filters are identified based on the evaluated attributes.

Abstract: Methods and systems for managing distributed systems are disclosed. The distributed systems may include any number of data processing systems that may contribute to the functionality of the distributed system. To contribute to the functionality of the distributed system, each of the data processing systems may need to be configured to positively contribute to one or more functions. To manage configuration of data processing system, user input reflecting the intents of users may be obtained. The user input may reflect responses to multiple inquires which may elucidate a user's true intent with respect to user of services provided by data processing systems.

Abstract: In one embodiment, a method includes receiving a user query inputted on a head-mounted device from the head-mounted device, wherein the user query corresponds to multiple dialog-intents, executing multiple tasks corresponding to the multiple dialog-intents, generating a multi-perspective response by a stitching model based on two or more of execution results of the multiple tasks, wherein the stitching model combines the two or more of the execution results based on natural language processing, and wherein the multi-perspective response comprises a natural-language response combining the two or more execution results, and sending instructions to the head-mounted device for presenting the multi-perspective response on the head-mounted device.

Abstract: The present technology provides for facilitating efficient identification of relevant metrics. In one embodiment, a set of candidate metrics for which to determine relevance to a user is identified. For each candidate metric, a set of distribution parameters is determined, including a first distribution parameter based on implicit positive feedback associated with the metric and usage data associated with the metric and a second distribution parameter based on the usage data associated with the metric. Such usage data can efficiently facilitate identifying relevance even with an absence of negative feedback. Using the set of distribution parameters, a corresponding distribution is generated. Each distribution can then be sampled to identify a relevance score for each candidate metric indicating an extent of relevance of the corresponding metric. Based on the relevance scores for each candidate metric, a candidate metric is designated as relevant to the user.

Abstract: A data mapping system provides a share, reusable and single mapping tool for mapping data and data lineage. The mapping system provides a version control functionality in the form of spreadsheet for tracking a plurality of mapping tasks that occur in parallel. The system allows multiple users to view the changes in mapping tasks, thereby improving data mapping visibility. Such visibility can significantly reduce conflicts between different mapping tasks that are independently performed by different teams or persons.

Abstract: A blockchain-based data synchronization method, executed by a first service node, includes: acquiring target block data having a minimum block height that is greater than a first local block height, the first local block height being a maximum block height of local block data of the first service node before the first service node acquires the target block data; determining a block height of missing block data according to a block height of the target block data and the first local block height, the block height of the missing block data being less than the minimum block height of the target block data and greater than the first local block height; and requesting a target service node to synchronize the missing block data according to the block height of the missing block data.

Abstract: The present disclosure discloses a method and apparatus for displaying map points of interest, and an electronic device, relates to the field of artificial intelligence, and in particular to intelligent transportation. A specific implementation solution includes: acquiring features corresponding to multiple candidate points of interest; determining predicted popularity of the multiple candidate points of interest according to a mapping relation between each feature and each popularity and the features of the multiple candidate points of interest, and the mapping relation is determined based on the frequency of operations performed by a user for each sample point of interest in a historical time period; and displaying the candidate points of interest of which predicted popularity meets a preset popularity condition in a map. Therefore, the accuracy of the displayed points of interest may be enhanced.

Abstract: A computer-implemented system and method for predicting and flagging an anomaly entered in a digital form. A server computing device classifies a plurality of data fields of the digital form to identify a set of non-zero value data fields; and obtains an anomaly detection model comprising a statistical tree structure associated with the data field of the digital form. The server computing device receives datasets including a target value of a data field and values of a set of cohorting data features; traverses a statistical tree structure of the anomaly detection model with the target dataset to form a set of target cohorts to determine a target statistic value for the data field; flags the data field value of the target dataset as an anomaly item; and generates one or more confidence scores for a runtime prediction based on one or more variance changes for the data field.

Abstract: A request is received to perform a management action for a domain of a name service, wherein the name service is implemented using at least both a first blockchain network and a second blockchain network different from the first blockchain network. A determination is made whether the domain is currently managed on the first blockchain network or the second blockchain network. The management action for the domain is caused to be performed based on the determination of whether the domain is currently managed on the first blockchain network or the second blockchain network.

Abstract: One aspect of the subject matter described herein comprises a database management system. The database management system comprises a communication circuit, an interface, and a processor. The communication circuit receives information from databases via a communication network. The interface allows user operation and interaction via the communication network and the database management system. The processor provides data to and receives data from the interface, including a plurality of alphanumeric records comprising at least one unique identifier, obtains database records from other databases for each unique identifier, identifies a number of alphanumeric records in the plurality having events in their histories, determines a percentage of alphanumeric records in the plurality having negative events in their histories, generates a report including the determined percentages, and conveys the report to the user.

Abstract: One example method includes, for each document in a group of annotated documents, extracting a set of words from the annotated document, and each of the words is positioned in a respective field of the annotated document. The method further includes using an aggregation function to determine, for one of the fields, a similarity of each one of the annotated documents to all of the other annotated documents, creating a document layout graph with nodes that each correspond to a respective annotated document, and each node is connected to all other nodes for which a similarity threshold for the one field has been met, and running an algorithm on the document layout graph to identify a clique of the annotated documents, and each annotated document in the clique has a similar layout to respective layouts of the other annotated documents in the clique.