Abstract: This application relates to apparatus and methods for automatically grouping the same or similar items provided by various suppliers that may use various supplier identification systems to identify the items to a retailer. In some examples, a computing device receives a supplier identifier from a supplier. The supplier identifier identifies an item that the supplier provides to the retailer for sale. The computing device may determine a group identifier for the item, where the group identifier identifies the item within a group of the retailer. The computing device may update the supplier identifier's association to the retailer identifier based on whether the group identifier is also associated with the retailer identifier. In some examples, the computing device executes a machine learning model to determine anomalies within a current database of supplier identifiers and associated retailer identifiers. In some examples, the computing device indicates changes to associations and any detected anomalies.

Abstract: A method, system, and apparatus for managing a persistent query result set are disclosed. A resource manager is disclosed that receives a query from a client over a computer network. A computer database server is disclosed that executes the query and generates a result set based on and in response to the received query. An execution platform is disclosed that divides the result set into a plurality of chunks, wherein each chunk comprises a portion of the generated result set. The resource manager adds metadata to each of the plurality of chunks. A first chunk of the plurality of chunks comprises metadata pointing to the plurality of chunks. The resource manager delivers at least the first chunk of the plurality of chunks to the client in response to the query. The execution platform offloads the remaining plurality of chunks to cloud storage in parallel.

Abstract: Methods, systems, and programming for retrieving content items for a search are described herein. In a non-limiting embodiment, a query including a plurality of terms may be received. For each of the plurality of terms, a posting list of one or more content items may be obtained. The posting list may include a ranked list of term scores corresponding to the one or more content items, each of the term scores being indicative of a level of relevance of a corresponding content item to a term associated with the posting list. A list of relevant content items for the query may be determined based on the term scores in each posting list for the one or more content items identified with respect to each term. At least one of the relevant content items may be provided as a response to the query.

Abstract: A system to collect and store in a special data structure arranged for rapid searching massive amounts of data. Performance metric data is one example. The performance metric data is recorded in time-series measurements, converted into unicode, and arranged into a special data structure having one directory for every day which stores all the metric data collected that day. The data structure at the server where analysis is done has a subdirectory for every resource type. Each subdirectory contains text files of performance metric data values measured for attributes in a group of attributes to which said text file is dedicated. Each attribute has its own section and the performance metric data values are recorded in time series as unicode hex numbers as a comma delimited list. Analysis of the performance metric data is done using regular expressions.

Abstract: Systems and methods for restoring a database in an information management system that does not include a secondary copy of the database, are disclosed. The systems and methods may include using metadata stored in non-production storage devices to restore the database. In some implementations the methods are used to consolidate multiple information management systems. In other implementations, the systems and methods are used for reviewing content of archived storage media. Other implementations are disclosed.

Abstract: The present disclosure is related to a method and an apparatus for data migration in a database cluster. The method includes obtaining a snapshot of a source data node and recording incremental data in a to-be-migrated data shard in the source data node according to inventory data. The method includes migrating the inventory data to a target data node. The method also includes migrating the incremental data, and during the migration when the unmigrated incremental data satisfies a preset write-lock condition, instructing the source data node to perform a write-lock operation on the to-be-migrated data shard and migrate unmigrated incremental data to the target data node. The method further includes, after the migration of the incremental data is completed, instructing a coordinator node to switch a route corresponding to the to-be-migrated data shard from the source data node to the target data node.

Abstract: Described is an improved approach to implement parallel queries where session states are saved for parallelization resources. When work needs to be performed in the parallel query system for a given session, a search can be performed to identify a resource (from among the pool of available resources) that had previously been used by that session, and which had saved a session state object for that previous connection to the session. Instead of incurring the entirety of setup costs each time workload is assigned to a resource, the saved session state can be used to re-set the context for the resource to the configuration requirements for that session.

Abstract: Disclosed are systems and methods for XBRL tag suggestion and validation. In some embodiments, the method includes the steps of: receiving an XBRL document associated with one or more assigned XBRL tags; analyzing the XBRL document using a trained machine learning model to generate one or more suggested XBRL tags and determine one or more corresponding confidence values; comparing the one or more assigned XBRL tags with the one or more suggested XBRL tags to generate comparison results; and determining a tag confidence value associated with each assigned XBRL tag of the one or more assigned XBRL tags based on the comparison results.

Abstract: A method, system, and apparatus for managing a persistent query result set are disclosed. A resource manager is disclosed that receives a query from a client over a computer network. A computer database server is disclosed that executes the query and generates a result set based on and in response to the received query. An execution platform is disclosed that divides the result set into a plurality of chunks, wherein each chunk comprises a portion of the generated result set. The resource manager adds metadata to each of the plurality of chunks. A first chunk of the plurality of chunks comprises metadata pointing to the plurality of chunks. The resource manager delivers at least the first chunk of the plurality of chunks to the client in response to the query. The execution platform offloads the remaining plurality of chunks to cloud storage in parallel.

Abstract: Disclosed is a knowledge system for retrieving a knowledge object, pertaining to a query, in a cognitive decision-making process. The knowledge system comprises a knowledge access module and a knowledge processing module. The knowledge access module may receive a knowledge request requesting a knowledge object. In one aspect, the knowledge request may be associated to at least one domain. The knowledge access further generates a structured query based on the knowledge request. The knowledge access module further splits the structured query into one or more sub queries. In one aspect, the structured query may be split based on the at least one domain and metadata associated to the at least one domain. The knowledge access module further fetches one or more knowledge objects for each sub query upon executing the one or more sub queries on a system database storing a plurality of knowledge objects.

Abstract: The system and methods disclosed herein include a runtime architecture that takes a nonspecific set of systems of differential equations, distributes them across the network, and iteratively integrates them through time with a possibility to output the results on every iteration. Embodiments of the disclosed system may be used for neural computation or any other suitable application. Embodiments can be used as a standalone engine or as part of another computational system for massively parallel numerical integration of a data-driven dynamical system.

Abstract: Techniques are described for schema lifecycle management. In one example, a method includes dividing, with one or more processing devices, a plurality of statements of a data definition language (DDL) script into a plurality of groups, the plurality of groups configured to be executed in parallel by a persistence layer. The method further includes assigning, with the one or more processing devices, one or more of the plurality of groups to a plurality of worker applications. The method further includes executing, with the one or more processing devices, constituent statements of the plurality of statements of the DDL script within each group of the plurality of groups by the plurality of worker applications in a session.

Abstract: Disclosed are various examples for categorization using an organizational hierarchy. In one example, a management service obtains user identifiers for users associated with an enterprise. The management service sends a request for subordinate data for each user to a directory service. The management service generates a hierarchy that links the users based on the subordinate data. The management service generates a map using the hierarchy. The map includes a user identifier and a level for each user. The management service sends the map to a client device.

Abstract: A computer system and computer implemented method that obtains coordinated results from at least two queries by utilizing context data of each query. Specifically, the computer system and computer implemented method facilitates enhanced querying functionality by matching entangled queries to achieve coordinated results.

Abstract: Various embodiments provide a shipping request system for dynamically identifying one or more restricted items within shipping requests. The system comprises: one or more memory storage areas containing data and one or more computer processors. The computer processors are configured to: receive input content data comprising one or more terms descriptive of one or more items for which shipment is requested, and retrieve trigger data from the one or more memory storage areas, the trigger data being associated with one or more terms related to one or more restrictions placed upon shipment of an item. The input content data is then dynamically compared against the trigger data to identify one or more correlations indicative of the presence of one or more restricted items. If correlations are identified, further shipment request processing is prevented; otherwise processing may continue. Associated computer program products and computer implemented methods are also provided.

Abstract: A distributed object store can expose object metadata, in addition to object data, to distributed processing systems, such as Hadoop and Apache Spark. The distributed object store may acts as a Hadoop Compatible File System (HCFS), exposing object metadata as a collection of records that can be efficiently processed by MapReduce (MR) and other distributed processing frameworks. A distributed processing job can specify a metadata query to narrow the set of objects returned. Related methods are also described.

Abstract: According to one embodiment of the present invention, a system for processing a database query stores one or more result sets for one or more first database queries in a data store. The system receives a second database query and compares the second database query to the one or more first database queries to determine presence of a corresponding result set in the data store for the second database query. The system provides the corresponding result set from the data store for the second database query based on the comparison. Embodiments of the present invention further include a method and computer program product for processing a database query in substantially the same manners described above.

Abstract: Some event ordering requirements can be determined based on continuous event processing queries. Other event ordering requirements can be determined based on distribution flow types being used to distribute events from event streams to node executing the queries. Events from event streams can be ordered according to ordering semantics that are based on a combination of all of these event ordering requirements. Additionally, virtual computing nodes can be associated with constraints, and computing processors can be associated with capabilities. Virtual computing nodes for processing event streams can be assigned to execute on various computing processors based on both these constraints and capabilities. Additionally, for each of several events in an event stream, a ratio between a total latency and a communication latency can be for determined. Based on an average of these ratios, a quantity of reducing nodes that will be involved in a map-reduce operation can be selected.

Abstract: A system and method of operating an electronic device may include loading an operating system, from a boot key, on the electronic device during turn-on of the electronic device. The operating system may be operated on the electronic device. The boot key may cause the electronic device to automatically communicate with a web-service located on a communications network to enable executable instructions from the web-service to be communicated to the electronic device for execution thereon.

Abstract: Application launcher sizing techniques are described. In one or more implementations, a likely usage context is determined, by a computing device, of a user in interacting with the computing device. An application launcher is dynamically sized within a display area of the user interface by the computing device based on the determined likely usage context of the user. The application launcher is configured for output responsive to an input received from a user and includes a plurality of representations of applications that are selectable to navigate to a user interface corresponding with a respective said application.

Abstract: Systems, methods, and machine-readable media are provided for database diagnostics. A specification of a target database system may be processed. A diagnostic tool, corresponding to a plug-in for transmission to the target database system, may be created. A script may be selected to conditionally execute on the target database system when detected values of a monitored parameter satisfy conditional criteria. A plug-in structure that encapsulates modules of the plug-in may be defined. The diagnostic tool may be transmitted via a network to the target database system to cause the diagnostic tool to be executed on the target database system. The execution of the diagnostic tool may include executing a first iteration of the plug-in based on a first threshold specified by conditional criteria, and executing a subsequent iteration of the plug-in based on a subsequent threshold specified by the conditional criteria after the conditional criteria has been adjusted.

Abstract: Embodiments relate to joining data across a parallel database and a distributed processing system. Aspects include receiving a query on data stored in parallel database T and data stored in distributed processing system L, applying local query predicates and projection to data T to create T?, and applying local query predicates and projection to L to create L?. Based on determining that a size of L? is less than a size of T? and that the size of L? is less than a first threshold, transmitting L? to the parallel database and executing a join between T? and L?. Based on determining that a number of the nodes distributed processing system n multiplied by the size of T? is less than the size of L? and that the size of T? is less than a second threshold; transmitting T? to the distributed processing system and executing a join between T? and L?.

Abstract: Parallel processing of data may include a set of map processes and a set of reduce processes. Each map process may include at least one map thread. Map threads may access distinct input data blocks assigned to the map process, and may apply an application specific map operation to the input data blocks to produce key-value pairs. Each map process may include a multiblock combiner configured to apply a combining operation to values associated with common keys in the key-value pairs to produce combined values, and to output intermediate data including pairs of keys and combined values. Each reduce process may be configured to access the intermediate data output by the multiblock combiners. For each key, an application specific reduce operation may be applied to the combined values associated with the key to produce output data.

Abstract: Continuously blocking query result data for a remote query is provided. Included is: creating a first connection, using a communications network, between a database server and a client. At least one secondary connection is created, using the communications network, between the database server and the client, based on the database server supporting a continuous block fetch protocol. Using the at least one secondary connection, the database server receives at least one cursor-based fetch query. The database server generates continuous blocks of result data, based on the received at least one cursor-based fetch query and sends to the client, using the at least one secondary connection, the continuous blocks of result data.

Abstract: According to an embodiment there is provided a method for handling requests in a storage system including a plurality of storage nodes connected to each other via a communications network. A first storage node of the plurality of storage nodes may store a reference to a set of at least one collection object stored in the storage system. Each collection object of the set may include at least one of a reference to another collection object stored in the storage system and a reference to at least one data file stored in the storage system. The method may include receiving a first request at the first storage node. The first storage node, for each collection object of the set, may send a second request to a storage node storing the collection object. According to a second aspect there is also provided a storage node.

Abstract: A system for storing time series data includes an ingester that prepares metadata indices associated with blocks of incoming time series data and stores the blocks of data in a time series database and the indices in a separate index database. The time series database distributes storage of the data blocks among multiple data nodes. A query layer receives queries and uses the index database to determine which data blocks are needed to process the query, and then requests only those data blocks from the time series database. Processing of the query is performed within the time series database only on those data nodes that contain relevant data, and partial results are passed to an output layer for formation into a final query result.

Abstract: A computer-implemented method for minimizing join operation processing time within a database system based on estimated joined table spread of the database system has been provided. The computer-implemented method includes, estimating value distribution of data in a joined table, wherein the joined table is a result of join operation between two instances of tables of a database system. The computer-implemented method further includes determining boundaries for partitioning at least one range of attributes of the estimated value distribution, wherein the boundaries for partitioning at least one range of attributes of the estimated value distribution corresponds to a same number of rows of the joined table. The computer-implemented method further includes determining at least one assignment of the determined partition of the at least one range of attributes to processing units of the database system.

Abstract: A computer-implemented method for minimizing join operation processing time within a database system based on estimated joined table spread of the database system has been provided. The computer-implemented method includes estimating value distribution of data in a joined table, wherein the joined table is a result of join operation between two instances of tables of a database system. The computer-implemented method further includes determining boundaries for partitioning at least one range of attributes of the estimated value distribution, wherein the boundaries for partitioning at least one range of attributes of the estimated value distribution corresponds to a same number of rows of the joined table. The computer-implemented method further includes determining at least one assignment of the determined partition of the at least one range of attributes to processing units of the database system.

Abstract: Concepts and technologies are disclosed herein for generating and using temporal metadata partitions. Metadata can be stored in temporal metadata partitions based upon a time range included in the metadata. Furthermore, metadata can be stored in multiple temporal metadata partitions to which the metadata is relevant. As such, metadata can be stored in manner that allows event data to be understood in the context of temporally accurate and/or relevant metadata. Functionality for executing queries of event data and providing results in view of metadata, as well as the merging of multiple temporal metadata partitions also are disclosed.

Abstract: Disclosed are a database selection system and/or a method to automatically adjust a database schema based on an input data. The method of the database selection system includes identifying an attribute of the input data. An optimal database type is determined in which the input data is to be stored based on a match between the optimal database type and the attribute. The method selects an ideal database based on the optimal database type from a set of distributed heterogeneous databases. The method determines if an existing database schema of the ideal database is optimally structured based on the input data. An ideal database schema is automatically adjusted based on the input data using a processor and a memory.

Abstract: In general, in one aspect, a method includes receiving, by the one or more processors, from a client device, data specifying a query image, requesting, by the one or more processors, text labels responsive to the query image from a database of text labels associated with images, in response to no zero text labels that meet a threshold being returned for the request, sending, by the one or more processors, request data to the client device that causes the client device to display a prompt to enter a textual search query, receiving, in response to the request data, a textual search query from the client device, and in the database of text labels associated with images, associating, by the one or more processors, the textual search query with the query image. This and other embodiments of this aspect can include corresponding systems, apparatus, and computer program products.

Abstract: The present invention is directed to methods and systems of implementing a guaranteed SQL insert operation. In one embodiment, the method may include initiating an SQL insert operation for a database, receiving an SQL exception indicating that a failover for the database has occurred, and in response to the SQL exception, caching the SQL insert operation and caching the SQL insert operation as an SQL merge operation. The method further includes determining that a primary key is associated with the SQL insert operation, and in response to determining that a primary key is associated with the SQL insert operation, executing the SQL merge operation.

Abstract: A parallel-processing apparatus and method provide for synchronous replication in a database management system (DBMS). During synchronous replication into the active node and the standby node in the DBMS, replications of transactions are parallelized in units of transactions, thereby improving a performance of the DBMS, guaranteeing atomicity and consistency of the transaction, and solving the deadlock state which may occur in parallel-processing.

Abstract: Techniques for parallel processing of directory searches are provided. A directory search is received on a multicore or multiprocessor architecture machine. At least two threads processing on different cores or processors of the machine handle different aspects of the directory search. A first thread identifies matches in the directory for the search and serially populates the matches to search results. The second thread serially and in parallel grabs the matches in the search results and filters some out and modifies other ones of them to complete processing on the search. The search results are then returned to an initial requester making the initial search.

Abstract: A method for organizing and searching objects from a plurality of databases includes querying an attribute of each entry stored in the plurality of databases; assigning a memory value for each of the attributes retrieved from each of the objects stored in the plurality of databases and storing the memory values for each of the attributes in a cache. At a client device, a search query is received and it is determined if the search query contains an attribute of the entry to be searched. Upon positive determination, a search is performed at the cache using the attribute contained in the search query; and upon negative determination, a search for the entry is performed at the plurality of databases.

Abstract: A method of parallel processing an ordered input data stream that includes a plurality of input data elements and a corresponding plurality of order keys for indicating an ordering of the input data elements, with each order key associated with one of the input data elements, includes processing the input data stream in a parallel manner with a plurality of worker units, thereby generating a plurality of sets of output data elements. The plurality of sets of output data elements is stored in a plurality of buffers, with each buffer associated with one of the worker units. An ordered output data stream is output while the input data stream is being processed by outputting selected output data elements from the buffers in an order that is based on the order keys.

Abstract: A server system receives a visual query and identifies an entity in the visual query. The server system further identifies a client-side action corresponding to the identified entity and creates an actionable search result element configured to launch the client-side action. Examples of actionable search result elements are buttons to initiate a telephone call, to initiate email message, to map an address, to make a restaurant reservation, and to provide an option to purchase a product. The entity identified in the visual query may be indirectly associated with a client-side action whose contact address or appropriate link is found in a search result associated with the identified entity. The client system receives and displays the actionable search result element, and upon a user selection of the actionable search result element, launches the client-side action in an application distinct from the visual query client application.

Abstract: An elastic parallel database system where metadata is specified out-of-band during database operations via a set of augmentation rules. The rules are used to augment or modify commands received, and indicate whether they are to be used for specific connections on which they are received, for all client connections, or some other scope.

Abstract: The present invention includes systems and methods for retrieving information via a flexible and consistent targeted search model that employs interactive multi-prefix, multi-tier and dynamic menu information retrieval techniques that provide context-specific functionality tailored to particular information channels, as well as to records within or across such channels, and other known state information. Users are presented with a consistent search interface among multiple tiers across and within a large domain of information sources, and need not learn different or special search syntax. A thin-client server-controlled architecture enables users of resource-constrained mobile communications devices to locate targeted information more quickly by entering fewer keystrokes and performing fewer query iterations and web page refreshes, which in turn reduces required network bandwidth.

Abstract: Techniques are provided for improving performance of parallel execution plans that include serial operations. A database server generates a parallel execution plan and includes one or more serial data flow objects in the parallel execution plan, each data flow object including one or more serial row sources. A parallel selector row source is associated with each serial data flow object included in the parallel execution plan. Each parallel selector row source coordinates with a query coordinator process the execution of the associated serial data flow object. In the event that that a plurality of serial data flow objects are included in a parallel execution plan, serial row sources included in the serial data flow objects may be executed concurrently by a separate parallel slave process, instead of sequential execution of each serial row source by the query coordinator process.

Abstract: Techniques are provided for storing files in a parallel computing system using sub-files with semantically meaningful boundaries. A method is provided for storing at least one file generated by a distributed application in a parallel computing system. The file comprises one or more of a complete file and a plurality of sub-files. The method comprises the steps of obtaining a user specification of semantic information related to the file; providing the semantic information as a data structure description to a data formatting library write function; and storing the semantic information related to the file with one or more of the sub-files in one or more storage nodes of the parallel computing system. The semantic information provides a description of data in the file. The sub-files can be replicated based on semantically meaningful boundaries.

Abstract: Code is injected into a web page loaded by an Internet browsing application. A search control to accept Internet search input is presented within an Internet browsing application. The search control visually covers at least a portion of a content display area of the Internet browsing application. A slider search control may be presented by automatically sliding the slider search control into the content display area. The presentation of a lightbox search control may include shading, darkening, dimming, blurring, or opaquing the content display area outside of the lightbox search control. The presentation of the search control may occur in response to a period of user inactivity, an amount of page scrolling, or a percentage of page scrolling. The search control receives input corresponding to a search query, a tracking code is combined with the received input, and the combination is communicated to a search engine.

Abstract: A storage controller is implemented for controlling a storage system. The storage controller may be implemented using a distributed computer system and may include components for servicing client data requests based on the characteristics of the distributed computer system, the client, or the data requests. The storage controller is scalable independently of the storage system it controls. All components of the storage controller, as well as the client, may be virtual or hardware-based instances of a distributed computer system.

Abstract: A location associated with a user of a computing device and a prefix portion of an input string may be received as one or more successive characters of the input string are provided by the user via the computing device. A list of suggested items may be obtained based on a function of respective recommendation indicators and proximities of the items to the location in response to receiving the prefix portion, and based on partially traversing a character string search structure having a plurality of non-terminal nodes augmented with bound indicators associated with spatial regions. The list of suggested items and descriptive information associated with each suggested item may be returned to the user, in response to receiving the prefix portion, for rendering an image illustrating indicators associated with the list in a manner relative to the location, as the user provides each successive character of the input string.

Abstract: A storage controller is implemented for controlling a storage system. The storage controller may be implemented using a distributed computer system and may include components for servicing client data requests based on the characteristics of the distributed computer system, the client, or the data requests. The storage controller is scalable independently of the storage system it controls. All components of the storage controller, as well as the client, may be virtual or hardware-based instances of a distributed computer system.

Abstract: A content management system provides a profiling mechanism that automatically tags changes made to elements in a document with applicability metadata, and uses the applicability metadata when processing a request to the repository by a user to filter the query results according to a profile for the user. A profiling mapping policy defines roles for users of the content management system. When content is requested from the repository, the profiling mechanism inserts one or more additional request parameters based on the profile of the user. The results that match both the original request and the additional request parameter(s) are returned to the user. When the user views the results, additional filtering may occur to filter individual elements from the user that do match the user's profile.

Abstract: A system and method of massively parallel data processing are disclosed. In an embodiment, a method includes generating an interpretation of a customizable database request which includes an extensible computer process and providing an input guidance to available processors of an available computing environment. The method further includes automatically distributing an execution of the interpretation across the available computing environment operating concurrently and in parallel, wherein a component of the execution may be limited to at least a part of an input data. The method also includes automatically assembling a response using a distributed output of the execution.

Abstract: A system and method for parallel processing of semantically grouped data in data warehouse environments is disclosed. A datastore object having a number of records is generated in a data warehouse application. A hash value is added to each record. The hash value has an integer domain, and is uniformly distributed over the integer domain across the datastore object. A selection table is generated to create a number of tasks based on discrete ranges of the hash value. Then, a transformation routine is executed on each of the number of tasks in parallel to generate an infocube of data that corresponds to each range of the discrete ranges of the hash value.

Abstract: Methods and apparatus are provided for geospatial management and visualization of events, by presenting a dynamic, user-interactive geospatial environment for performing real-time operations management and pre/post-mission analytical activities. A geospatial event management system integrates geospatial imagery data from geospatial imagery data sources, and determines a geographic area of interest based on user input, stored settings, or other relevant parameters. The geospatial event management system then provides a user-interactive geospatial environment based on the geospatial imagery data associated with the geographic area of interest, and ingests geospatially-referenced event data associated with the events, such as tracking data, telemetry data, or sensor data.

Abstract: A random number generation process generated uncorrelated random numbers from identical random number sequences on parallel processing database segments of an MPP database without communications between the segments by establishing a different starting position in the sequence on each segment using an identifier that is unique to each segment, query slice information and the number of segments. A master node dispatches a seed value to initialize the random number sequence generation on all segments, and dispatches the query slice information and information as to the number of segments during a normal query plan dispatch process.