Abstract: Computer-implemented methods and systems are disclosed for receiving and indexing a plurality of files for later querying, for dynamically generating scripts to be executed during a query of a data store, and for horizontally distributing a query and aggregating results of the distributed query.

Abstract: Pairwise entity matching systems and methods are disclosed herein. A deep learning model may be used to match entities from separate data tables. Entities may be preprocessed to fuse textual and numeric data early in the neural network architecture. Numeric data may be represented as a vector of a geometrically progressing function. By fusing textual and numeric data, including dates, early in the neural network architecture the neural network may better learn the relationships between the numeric and textual data. Once preprocessed, the paired entities may be scored and matched using a neural network.

Abstract: A method of generating matching metadata vectors for identifying content items in a store searchable by input vectors, the method comprising: receiving multiple training inputs, each training input comprising a content identifier indicative of a content item, and at least one natural language description of the content item; for each training input: converting the natural language description into at least one text component; generating at least one vector, each vector corresponding to one text component; generating a set of component parts for each vector, each component part corresponding to a coordinate initialized with a random value; adjusting each random coordinate based on the relationship of each component part to other vectors; determining a weighting for each vector with respect to the item; and defining a metadata vector for each item comprising the vectors containing the adjusted coordinates for that item and the weighting for each vector.

Abstract: In some examples, a system performs data deduplication using a deduplication fingerprint index in a hash data structure comprising a plurality of blocks, wherein a block of the plurality of blocks comprises fingerprints computed based on content of respective data values. The system merges, in a merge operation, updates for the deduplication fingerprint index to the hash data structure stored in a persistent storage. As part of the merge operation, the system mirrors the updates to a cached copy of the hash data structure in a cache memory, and updates, in an indirect block, information regarding locations of blocks in the cached copy of the hash data structure.

Abstract: A method of storing a data object includes dividing data of a data object into a first part of data and a second part of data, in response to receiving a writing request for a data object, the first part of data including a data field of the data object, the second part of data including a meta data of the data object; writing the first part of data into a first data file stored in a first external storage device; and writing, into a second data file stored in a second external storage device, first location information, and the second part of data, the first location information including location information of the first part of data within the first external storage device.

Abstract: Provided is a method, computer program product, and system for classifying a set of data items based on format organizations. A processor may determine at least one format organization of a set of data items. The format organization of a data item indicates a symbol type of at least one continuous symbol in the data item and a number of the at least one continuous symbol. The processor may determine at least one candidate data class for the set of data items from a plurality of predetermined data classes based on the at least one format organization. The processor may classify the set of data items into at least one target data class selected from the at least one candidate data class. In this way, the set of data items can be efficiently classified.

Abstract: This application relates to a client-server architecture that enables search queries to be applied to transcription information for multimedia files. A server device implements a service configured to query a search platform to retrieve results associated with a plurality of multimedia files stored in a content database. The results are ordered according to a plurality of heuristic values calculated based on a text relevance analysis. The service is configured to modify the heuristic values to adjust an order of the results, and generate a response to a search request that includes a representation of at least a portion of the transcription information of the multimedia files referenced by the results. The heuristic values are modified based on at least one of a popularity score for a corresponding multimedia file, a weight associated with a particular field, or a relevance score based on feedback signals.

Abstract: A system and a method for contextual categorization of data comprises a server having a processor and a non-transitory computer-readable storage medium in electronic communication with the processor and comprising program instructions executable by the processor to access an initial inventory of data set and metadata associated with the initial inventory of data set. The system is then configured to classify the initial inventory of data set by using the metadata into (a) reduced set of data comprising high level sensitivity classification and (b) a remainder data set.

Abstract: The innovation disclosed and claimed herein, in one aspect thereof, comprises systems and methods of remote scheduling of calendar and other means based queues and reminders to a user of a presentation device. The user of the presentation device may be suffering from a progressive cognitive disorder, and the queues and other care provided may be provided remotely by a loved one or other administrator.

Abstract: The present disclosure relates to restricting electronic activities from being linked with record objects. According to at least one aspect of the disclosure, a method can include accessing, by one or more processors, a plurality of electronic activities, accessing a plurality of record objects of one or more systems of record, identifying an electronic activity of the plurality of electronic activities to match to one or more record objects, determining a data source provider associated with providing access to the electronic activity, and identifying a system of record corresponding to the determined data source provider. The system of record can include a plurality of candidate record objects to which to match the electronic activity. The method can include restricting the electronic activity from being linked with the at least one record object.

Abstract: A system may determine information in relation to a link in an interlinked set of information content items. A memory may store a set of machine-readable instructions operable, when executed by a processor, to receive a link context associated with a link in an information content item of the interlinked set. The link context may include information from the information content item providing context for the link. Instructions may also be operable to identify one or more additional links present in the link context and determine a link density as the proportion of the link context which includes the or each additional link relative to the size of the link context, and/or determine a text density as the proportion of the link context which does not include the or each additional link relative to the size of the link context and/or count the or each additional link.

Abstract: A method may include obtaining a first matrix that represents data in a data set and obtaining a number of clusters into which the data is to be grouped. The method may further include constructing a second matrix using the first matrix and the number of clusters. The second matrix may represent a formulation of a first optimization problem in a framework of a second optimization problem. The method may further include solving the second optimization problem using the second matrix to generate a solution of the second optimization problem and mapping the solution of the second optimization problem into a first solution matrix that represents a solution of the first optimization problem. The method may further include grouping the data into multiple data clusters using the first solution matrix. A number of the multiple data clusters may be equal to the number of clusters.

Abstract: The subject technology determines an availability zone skew among multiple zones. The subject technology, based on the availability zone skew, determines a target skew to meet a global balancing of cluster instances. The subject technology, based on the target skew, selects a particular zone among multiple zones. The subject technology deploys a particular type of cluster instance to the particular zone. The subject technology, for each zone from the multiple zones, determining a respective number of cluster instances. The subject technology identifies a first zone that includes a highest number of cluster instances based on the respective number of cluster instances from each zone. The subject technology identifies a second zone that includes a lowest number of cluster instances based on the respective number of cluster instances from each zone.

Abstract: Methods and systems are provided for improved access to rows of data in a distributed data system. Each data row is associated with a partition. Data rows are distributed in one or more files and an impure file includes data rows associated multiple partitions. A clustering set is generated from a plurality of impure files by selecting a candidate impure file based on file access activity metrics and one or more neighbor impure files. Data rows of the impure files included in the clustering set are sorted according to their respective associated partitions. A set of disjoint partition range files are generated based on the sorted data rows of the impure files included in the clustering set. Each file of the set of disjoint partition range files is transferred to a respective target partition.

Abstract: Methods, systems, and devices supporting data storage are described. A database server may store information in a group of files. As more information is stored at the database in the files, the sizes of the files may be increased. Techniques are described for uniformly growing files in the group of files to maintain a similar size for the files as the amount of storage increases. These techniques may prevent one file from becoming disproportionately larger than another file of the file group, supporting efficient read and write operations at the database. The file growth may be based on the file sizes as well as an amount of storage to be added for the group of files. For example, an application managing the file growth may sort the files by size, track uniform growth running totals, and determine file growth commands based on the uniform growth running totals.

Abstract: A computer-implemented method for representing and storing data in an extendable graph data structure using artificial intelligence includes obtaining business requirements data, business workflow data, and dictionary data. A relationship between one or more entities in the obtained business requirement data and the business workflow data is identified using the obtained dictionary data and applying a natural language processing technique and topic based trend identification from existing entities and associated attributes. An extendable graph data structure represented by an enriched adjacency matrix for the identified relationship between the one or more entities is generated and stored. One or more trends are identified using the stored graph data structure.

Abstract: A method and system for intelligent guided shopping. The system includes a computing device. The computing device has a processor and a storage device storing computer executable code. The computer executable code, when executed at the processor, is configured to provide inference models based on user search data. Each of the inference models includes nodes and edges between the nodes. Each of the edges pointing from a first node to a second node is characterized with a probability value. The probability value represents a probability of searching a second keyword corresponding to the second node after searching a first keyword corresponding to the first node.

Abstract: An artificial intelligence (AI) system that utilizes a machine learning algorithm, such as deep learning, etc. and an application of the AI system is provided. A method, performed by a server, of integrating and managing a plurality of databases (DBs) includes obtaining a plurality of knowledge graphs related to DBs generated from the plurality of DBs having different structures from one another, inputting the plurality of knowledge graphs related to DBs into a learning model related to DB for determining a correlation between data in the plurality of DBs, and obtaining a virtual integrated knowledge graph output from the learning model related to DB and including information about a correlation extracted from the plurality of knowledge graphs related to DBs.

Abstract: A method includes determining, by a computing system, a probability of whether at least a threshold portion of a particular advertisement will be presented on a particular content presentation device, and a cost associated with presentation of the particular advertisement on the particular content presentation device. The computing system calculates an expected revenue associated with presentation of the particular advertisement based on the probability and the cost. When the expected revenue exceeds a threshold revenue, the computing system communicates the particular advertisement to the particular content presentation device.

Abstract: A system and method for storage checkpointing to a group of independent computer applications. The system has a storage disk that stores files; a storage access interface to access the storage disk; and a computer. The computer runs the group of independent computer applications and utilizes the files stored on the storage disk. A file system on the server accesses the files stored on the storage disk. An operating system and at least one device driver can be called by the file system, and at least one buffer buffers first data written to the storage disk and second data read from the storage disk.

Abstract: A method, an apparatus, a system, and a computer program product for synchronizing databases. A computer system detects first information in a live view on a mobile display system while the first information is displayed by a first service on a data processing system. The first information corresponds to second information managed by a second service. The computer system determines whether a discrepancy is present between the first information displayed on the data processing system and the second information managed by the second service. The computer system performs a number of actions to resolve the discrepancy in response to the discrepancy being present.

Abstract: A computer-implemented system or process is programmed or configured to use a configuration file to specify one or more tasks to apply to raw ingested data. A task may be a sequence of instructions programmed or configured to format raw ingested data into a dataset in a CSV format. Examples of tasks may include: a parser to parse Cobol data into a CSV, a parser to parse XML into a CSV, a parser to parse text using fixed-width fields to a CSV, a parser to parse files in a zip archive into a CSV, a regular expression search/replace function, or formatting logic to remove lines or blank lines from raw ingested data. In one embodiment, the configuration file may specify a schema definition for a task to use for generating a dataset. In one embodiment, the configuration file may also include one or more access control list (ACL) definitions for the generated dataset. In one embodiment, the building of datasets using the configuration file is automated, for example, on a nightly basis.

Abstract: Embodiments of the present specification disclose a method, an apparatus, a system, a device, and a storage medium for answering user questions, including: obtaining a user question; encoding the user question and a schema level of pre-constructed structured data to obtain a first feature vector, wherein the structured data further comprises a data level, wherein the data level comprises knowledge for answering questions structured according to the schema level; retrieving one or more candidate sub-graphs related to the user question from the structured data; encoding the one or more candidate sub-graphs to obtain a second feature vector; performing multi-task classification for the user question based on the first feature vector and the second feature vector; and obtaining answer content for the user question based on a result of the multi-task classification.

Abstract: A serverless data processing architecture may be a high-velocity, cost-efficient and massively scalable log ingest application and event parser that may act as the intermediary between data collection and data analysis and may handle the receipt and parsing of incoming event data generated by collector and sensor applications. The log analytics data science portion of an ingest process may determine if arbitrarily structured log data is anomalous and/or security relevant via single event or multievent algorithms. There are numerous applications for both the single and multi-event log analytics platforms. Any application involving reliably finding anomalous pieces of semi-structured or unstructured text data may provide potential use cases. These processes may be particularly widely applicable because these processes are agnostic to and require no prior knowledge of the structure of the data.

Abstract: A device, system and method for anonymously comparing query images to reference images is provided. A computing device receives, from at least one camera, a query image. The computing device generates a query characteristic vector associated with the query image. The computing device applies a mathematical operator on the query characteristic vector to obtain a query vector. The computing device compares the query vector to a reference vector, the reference vector obtained by applying a complementary mathematical operator on a reference characteristic vector associated with a reference image, the complementary mathematical operator comprising a complement of the mathematical operator. The computing device, in response to the comparing indicating a match between the query vector and the reference vector, provides a notification of the match.

Abstract: In a database system, at least one metric associated with resources in a database system used by multiple classes of requests is monitored, where a first of the multiple classes is associated with a lower priority than a second of the multiple classes. A throttle limit is calculated for requests of the first class, based on the monitored metric. The calculated throttle limit is used to determine scheduling of the request of the first class for execution.

Abstract: Provided are systems and methods for enriching documents for indexing. An example method can include receiving a plurality of documents and generating a plurality of enriched documents. The generation of the plurality of enriched documents can include determining, based on a document of the plurality of documents, reference data, determining, based on the reference data and an enrichment policy, additional data, and adding the additional data to the document. Prior to the generation of the plurality of enriched documents, the method may index the reference data of plurality of documents to obtain a source index and generate, based on the enrichment policy and the source index, an enrichment index. The determination of the additional data may include reading the additional data from the enrichment index.

Abstract: A method and a server for determining parking suggestions for a destination location on a map comprising: acquiring based on the destination location, a set of past routes having been taken on the map by users and terminating at the destination location. A set of final locations associated with the set of past routes is determined, each final location being an actual ending location of users having taken the respective past route. A road graph including a set of map objects is acquired, where each map object has: a respective object location, a respective object class indicative of a respective type of structure on the map. The set of final locations is then clustered based on the destination location, the respective classes and the respective final locations to obtain a set of clusters on the road graph, where each cluster includes a respective subset of final locations.

Abstract: Attributes of a configuration item record of a configuration management database (CMDB) are received. Based on the received attributes, a determination is made that the configuration item record belongs to a new child class and no longer belongs to a previously identified child class. While maintaining a same identifier in the configuration item record, a classification of the configuration item record is changed to the new child class including by adding one or more attributes of the new child class to the configuration item record and removing one or more attributes of the previously identified child class from the configuration item record.

Abstract: The present teaching relates to searching. In one example, a search query is received from a person. A plurality of search results are retrieved based on the search query. An intent of the person is estimated with respect to at least some of the plurality of search results. The estimated intent is what the person intends to do with respect to the at least some of the plurality of search results. The plurality of search results are provided based on the estimated intent of the person.

Abstract: A method and apparatus for mining a general tag, a server and a medium are disclosed. The method can comprise: matching a tag seed rule containing a tag placeholder and an attribute of the tag placeholder with historical search information to determine a matching tag; combining the existing tag seed rule and the matching tag to construct a new search sequence set; and performing a generalization process on search sequences included in the new search sequence set to obtain a new tag seed rule, and returning to perform the operation of matching the new tag seed rule with the historical search information to determine a new tag until the tag and the tag seed rule satisfy a convergence condition. A more comprehensive and profound tag can be mined, and the entire flow of mining the tag can not be dependent on a vertical website.

Abstract: Embodiments may provide techniques for clustering using predefined anchors that take into account the knowledge about the anchors. For example, a method of clustering processing may be implemented in a computer comprising a processor, memory accessible by the processor, and computer program instructions stored in the memory and executable by the processor, the method comprising: receiving a plurality of points of data to be clustered and a plurality of predefined anchor data points and clustering the plurality of points of data and at least a subset of the predefined anchor data points. Further, the method may include creating a similarity function where anchor points pull stronger than regular points, such that they function as attractors.

Abstract: A method includes maintaining a hierarchical datastore for an agent instantiated in a computer-generated reality (CGR) environment. The hierarchical datastore includes a first storage hierarchy associated with a first data type and a second storage hierarchy associated with a second data type. The method includes detecting a sensory input that includes sensory input data. The method includes determining a type of the sensory input data. The method includes, in response to the sensory input data being of the first data type, storing the sensory input data in the first storage hierarchy for a first amount of time associated with the first storage hierarchy. The method includes, in response to the sensory input data being of the second data type, storing the sensory input data in the second storage hierarchy for a second amount of time that is different from the first amount of time.

Abstract: The subject technology determines, after a period of time elapses over a periodic segment of time, an imbalance of cluster instances deployed in multiple zones based on a threshold value, the cluster instances including different types of clusters associated with compute service manager instances. The subject technology identifies a particular type of cluster instance to include in a particular zone from the multiple zones. The subject technology adds the particular type of cluster instance to the particular zone to meet a global balancing of cluster instances in the multiple zones. The subject technology determines, after a second period of time elapses over the periodic segment of time, that a number of cluster instances deployed in the multiple zones is below the threshold value indicating a current balance of cluster instances in the multiple zones.

Abstract: The present disclosure relates to a method of loading data. The method includes checking a topic corresponding to a search word among a plurality of topics in response to acquiring a search word for a topic of a distributed messaging system from a user, checking a data format including one or more fields of a message loaded into a topic, and then loading data generated based on the checked data format and the read message into a data lake.

Abstract: Disclosed are a method and system for implementing a distributed persistent queue. To implement the queue, an API is defined that includes a command to enqueue an object onto the queue, to obtain the ordering of all objects in the queue and to remove any item from the queue. Enqueuing an object includes obtaining a unique ID for the object from a generator and then storing the object in a persistent shared log, which provides persistent storage for the queue. Obtaining an ordering of all objects in the persistent queue includes receiving for each object stored in the queue a pair of values, the first being the unique ID and the second being a sequence number from the persistent shared log. Regardless of the host computer system making the request for the ordering of objects in the queue the ordering provided to each host computer system is the same.

Abstract: A system includes first logic to obtain a fixed constituent data object and a variable constituent data object for each data object of a set of objects, second logic to analyze the fixed constituent data objects to allocate each fixed constituent data object to one of a plurality of fixed groups, third logic to analyze the variable constituent data objects to allocate each variable constituent data object to one of a plurality of variable groups, fourth logic to determine a net magnitude for each fixed group and for each variable group, fifth logic to determine a historical component for each variable constituent data object, sixth logic to determine a net historical magnitude for each variable group based on the historical components, and seventh logic to define at least one representative data object to represent the fixed and variable constituent data objects in each pair of fixed and variable groups having a matching common set of properties, the at least one representative data object maintaining the net

Abstract: Technologies are described for facilitating transaction processing within a database environment. A commit protocol provides for the atomic commit or rollback of a transaction that includes an operation that modifies a metadata entity of the database system and one or more other operations that modify metadata entities or data records of the database system. Innovations are provided for detecting and resolving deadlocks that may arise during transaction processing. Innovations are also provided for providing versioning of metadata entities, including invalidating metadata entities cached at a slave node during the commit at a master node of a transaction that creates a new version of the metadata entity.

Abstract: Embodiments described herein generally relate to searching of media items associated with one or more keywords. Content search features may be generated and configured to receive search scope selections. A root level limitation may be associated with a folder within a media organization architecture. A query limitation may be associated with the content search features. In certain embodiments, means for automatically correcting the search scope selections to satisfy the query limitation are provided.

Abstract: A file usage recorder program that is executed on a processor is disclosed. The file usage recorder program may be configured to determine usage data for a plurality of files stored in a file system. The usage data may include, for each file, a plurality of usage instances by one or more users. The file usage recorder program may further be configured to classify each of the plurality of files as being in one of a plurality of predetermined usage states, based on the determined usage data. The file usage recorder program may further be configured to generate a usage index indicating the usage state of each of the plurality of files, and output the usage index for use by a software program.

Abstract: The present disclosure provides an artificial intelligence-based triple checking method and apparatus, a device and a storage medium. The method comprises: generating a search query according to a triple to be checked; obtaining webpages of search result corresponding to the query; determining a confidence score of the triple according to the webpages of search result; determining whether the triple is an accurate triple according to the confidence score. The solution of the present disclosure can be employed to achieve efficient check of the triple.

Abstract: In general, in one aspect, the invention relates to a method for servicing requests. The method includes receiving, from a client system, a request comprising a query, where the query includes a first plurality of terms. The method further includes generating, using a thesaurus library, a related query including a second plurality of terms, where at least one term in the second plurality of terms is present in the first plurality of terms. The method further includes issuing the query to a content repository to obtain a first result, issuing the related query to the content repository to obtain a second result, processing the first result and the second result to generate a final result, and providing the final result to the client system.

Abstract: A computer implemented method, apparatus, and computer program are provided. The method is under control of one or more processors configured with executable instructions. The method detects, at a wireless activity (WLA) tracking apparatus, wireless activity of a mobile device in a proximity of a local wireless environment. The method automatically generates a WLA timestamp associated with the detecting the wireless activity of the mobile device and utilizes one or more of the wireless activity and WLA timestamp to identify one or more of a security device and a segment of security data collected by the security device.

Abstract: An adaptive data storage platform includes a plurality of nodes and a plurality of data stores, each associated with a different one of the nodes. An immutable journal distributed is between the plurality of nodes. Access to the data stores is based upon a consensus of trust determined by the plurality of nodes. The data is cyphered as it is received to form ciphered data that is sharded into equally sized shards that are distributed across the nodes for storing on a corresponding ones of the data stores and tracked using the immutable journal. The shard may be periodically sent to a different one of the nodes for storing on the corresponding data store. The data is thereby ciphered and distributed across the plurality of data stores and is not stationary.

Abstract: The invention relates to a method for automatically checking configuration changes intended to be applied to a search configuration. of a search engine of a search service. The method comprises creating a test search configuration, which comprises a copy of the search configuration. The intended configuration changes are applied to the copy of the search configuration. A set of sample documents and a set of test search queries are provided. The test search queries are executed on the set of sample documents using the test search configuration and performance indicators are determined for the execution. If the performance indicators satisfy a predefined criterion, the intended configuration changes are accepted for application to the search configuration.

Abstract: A computer-implemented method for storing documents in a centralized database system based on geographical data localization includes receiving, by a database manager, a request to update a document according to a data localization criterion, the document stored in a local storage device of the centralized database system. The method further includes determining, by the database manager, a geographical location for a local copy of the document based on an attribute of the document matching the localization criterion. The method further includes creating, by the database manager, a remote copy of the document on a storage device that is physically located in the geographical location. The method further includes modifying, by the database manager, the local copy of the document to include a location information of the remote copy.

Abstract: In one embodiment, a method includes receiving a request to identify a similarity in public sentiments for each pair from a plurality of entities from a second computing device, where the request includes names of the plurality of entities, accessing a table of word vector relationships, where the table of word vector relationships includes a plurality of unique n-grams and their corresponding word vectors, and where each of the word vectors represents a semantic context of a corresponding n-gram as a point in a d-dimensional embedding space, looking up word vectors corresponding to each of the names using the table, calculating, for each of the word vectors, a similarity metric to each of the word vectors, and sending a response message to the second computing device, where the response message includes calculated similarity metrics corresponding to all the pairs of the word vectors.

Abstract: Methods, apparatus, systems and articles of manufacture for automatic database failover in a master-replica replication configuration are disclosed. An example node within a database system having a plurality of nodes, includes an agent to select a first database operated at one of the plurality of nodes to function as a master database in a master-replica replication configuration. The agent is to cause the selected database to be configured as the master database. The agent is to configure a first reverse proxy of the node. The first reverse proxy is to receive a query from a load balancer and forward the query to the master database based on the configuration.

Abstract: A method and apparatus are provided. The method includes prior to receiving a current search term from client application of a user among plural users, obtaining historical search terms entered by the user during a first time period and, for each historical search term, one or more historical applications accessed by the user after entering the historical search term, separately obtaining feature data of the historical search terms, the one or more historical applications and candidate applications, the feature data being data combined from all of the plurality of users, training the feature data according to a mining model, and obtaining through mining using the trained feature data, for each candidate application, a recommendation term corresponding to the candidate application.

Abstract: A method that includes receiving a document, the document including multiple data units arranged in a sequence, is provided. The method includes separating a fragment from the sequence by identifying a delimiter that includes one of a start or an end of the fragment, separating a data unit from the fragment by identifying a second delimiter, determining a fragment rank based on a frequency score of the data unit within the fragment, and placing the fragment in a sorted list based on the fragment rank including multiple fragments. The method includes forming a modified document including at least a top fragment from the sorted list, the top fragment having a top fragment rank greater than a user selected rank and providing the modified document to the user. A system and a non-transitory, computer readable medium storing instructions to perform the method are also provided.