Abstract: Data is often populated into Configuration Management Databases (CMDBs) from different sources. Because the data can come from a variety of sources, it may have inconsistencies—and may even be incomplete. A Normalization Engine (NE) may be able to automatically clean up the incoming data based on certain rules and knowledge. In one embodiment, the NE takes each Configuration Item (CI) or group of CIs that are to be normalized and applies a rule or a set of rules to see if the data may be cleaned up, and, if so, updates the CI or group of CIs accordingly. In particular, one embodiment may allow for the CI's data to be normalized by doing a look up against a Product Catalog and/or an Alias Catalog. In another embodiment, the NE architecture could be fully extensible, allowing for the creation of custom, rules-based plug-ins by users and/or third parties.

Abstract: A method for updating a column store database and includes establishing a row store database, wherein each row comprises a plurality of attributes. The method includes establishing a column store database including attribute vectors corresponding to at least one attribute in the row store, wherein each attribute vector includes data used to satisfy at least one of previously received analytic queries. The method includes collecting a SQL change statements beginning from a synchronization point indicating when the row store database and the column store database are synchronized, and continuing until an analytic query is received. The method includes sending the plurality of SQL change statements to the column store database upon receipt of the analytic query for updating the column store database for purposes of satisfying the query, wherein the analytic query is directed to a queried range of primary key attributes in the plurality of attributes.

Abstract: A method may include maintaining first data structure with records organized in a first hierarchy, and maintaining a second data structure with records organized in a second hierarchy. The method may also include receiving a first change request for a value stored in a first record. The first change request may be received from a parent in the first data structure of the first record. The method may additionally include changing the first value according to the first change request, and receiving a second change request for the value stored in the first record. The second change request may be received from a parent in the second data structure of the first record. The method may further include sending a notification to the parent in the first data structure that the parent in the second data structure is attempting to change the first record.

Abstract: A method, system, and computer program product for determining a consistent point in time in a replication environment comprising determining periods of time that no IO was received from sources; wherein the periods are determined to account for differences between the clocks of the sources and the clock at a replication appliance, adjusting the periods of time that no IO was received by at least one delay factor, comparing the adjusted periods of time from the sources to determine a common period of time; wherein the common point in time denotes that each source was in a consistent state and marking the adjusted point in time as a consistent point in time in a journal.

Abstract: A method, computer program product, and computing system for determining, at the computing device, one or more dependencies associated with a plurality of managed objects and a plurality of backend objects. A plurality of consistency groups with one or more managed objects of the plurality of managed objects and one or more backend objects of the plurality of backend objects may be generated based upon, at least in part, the one or more dependencies associated with the plurality of managed objects and the plurality of backend objects. The one or more backend objects of the plurality of consistency groups may be fetched. The one or more managed objects of the plurality of consistency groups may be updated based upon, at least in part, the one or more fetched backend objects.

Abstract: A client information management apparatus comprises a hardware processor. The hardware processor performs: detecting a change in a department where one client member belongs and updating a department about one client member in client information if member name in client personal information is the same as a member name about the one client member registered with the client information and if the department in the client personal information differs from the department about the one client member registered with the client information; referring to the communication information and extracting a member relating to the one client member as an update target member from different client members registered with the client information; and updating a department about the update target member registered with the client information to the same department as the one client member.

Abstract: Consensus methods, systems, and apparatus, including computer programs encoded on computer storage media, are provided. One of the methods is to be implemented on a blockchain maintained by a number (N) of nodes. One of the nodes acts as a primary node and the other (N?1) nodes act as backup nodes. The method includes: detecting a change in a current height H of the blockchain; determining the primary node based on a parameter P and the number of nodes N, wherein the parameter P is proportional to the current height H of the blockchain; in response to determining that the one of the N nodes is the primary node, executing a PBFT normal operation protocol as the primary node; and in response to determining that the one of the N nodes is not the primary node, executing the PBFT normal operation protocol as one of the backup nodes.

Abstract: The present invention is directed to architectures for receiving, from requestors, requests for information, identifying appropriate responders, unknown to the requestors, to provide the requested information, and effecting interactions between the requestors and responders.

Abstract: Receiving a first model associated with a user, a generic model of a generic domain, and a specific domain having an associated domain-specific corpus. A first set of query terms based on elements of the first model, and a second set of query terms based on elements of the generic model, are determined. A third set of query terms is generated based on the first and second sets of query terms. The domain specific corpus is queried using the third set of query terms, and a domain specific model is generated based on results of the querying.

Abstract: Providing a random factoid in response to a user trigger is provided. Aspects are directed to a device, method, and computer-readable medium to provide random factoids responsive to a triggering event. Various inputs such as user taps, gestures, voice commands, environment commands, etc., are monitored to recognize a triggering event associated with the random factoid system. Upon determining that the input is a triggering event, a random factoid is randomly selected and provided to the user. The factoid can be a fun fact or a helpful learning tip. In some examples, the random factoid system provides a contextual random factoid based one or more contextual factors, such as geographic location of the device, the user's interaction history, the user's demographic data, etc., thus providing an improved user experience.

Abstract: A system, method, and computer-readable medium for performing an auto-query construction operation for use with a distributed analytics operation. More specifically, in certain embodiments, the auto-query construction operation provides automatically generates SQL code instructions via an auto-query construction user interface (UI) settings in a computational system, such as the Dell Statistica computational system. The auto-query construction operation allows a user to interact with a common interface to provide query information including decision variables, parameters of an analysis and convergence criteria. The query information provided via the UI is automatically transformed to database queries and subsequent computation system operations. Thus, the user experience remains intact whether the analytics is performed in database or within the computation system.

Abstract: Methods for splitting a plurality of records into subsets for parallel processing by separate threads are disclosed. In one embodiment, a plurality of records are added to a database. The adding includes tracking, for each unique value found in the plurality of records within a selected one of the sequence of fields, a statistic based on the values found in the plurality of records within a next one of the sequence of fields. Then a plurality of queries are generated, each includes a row value constructor (RVC) with a logical operation, a specific one of the unique values found within the selected one of the sequence of fields, and, for that specific value, the tracked statistic. Then a plurality of threads are caused to execute that each submit one of the queries and operate on a subset of the plurality of records responsive to execution of that query.

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: A computer system can generate a materialized query table (MQT) for data from a base table that has a plurality of rows and columns that each contain stored data. The computer system can receive a query to data stored in a row from the base table. The system can identify a column in the row and determine that data from a cell in the row and the column is above a threshold memory size. The system can generate, in response to determining that the data being above the threshold memory size, an MQT that includes data for the row and that includes a reference pointer that points to a location shared with another table.

Abstract: A method includes traversing a query plan tree having multiple nodes, each node representative of an operation on data that is the subject of a query, to extract multiple pipelines from the query plan tree, identify dependencies between the multiple extracted pipelines, and provide a pipeline dependent tree based on the dependencies between the multiple extracted pipelines for execution of the query by multiple processors.

Abstract: A system and method matches data from a first set of data with that of an other set of data in a manner based on the size of a memory.

Abstract: Embodiments are disclosed for facilitating the compilation of measure data. In the context of a method, an example embodiment includes generating, by configuration circuitry of an interpreter, at least one abstract syntax tree based on a CQL file containing measure logic and a CQL grammar file. This example embodiment of the method further includes converting, by the configuration circuitry, the at least one abstract syntax tree into at least one strongly-typed expression tree and storing the at least one strongly-typed expression tree in a memory. Finally, the example embodiment of the method may further include executing, by data evaluation circuitry of the interpreter, the at least one strongly-typed expression tree using retrieved user data. Corresponding apparatuses and computer program products are also provided.

Abstract: Provided are techniques for processing window partitioning and ordering for OLAP functions. A prior compare operation is performed by: receiving an input vector for each of one or more attributes of input data that represent one of a partition-by column and an order-by column in a database query; generating a per-attribute comparison vector for each input vector; and producing a single output vector using each per-attribute comparison vector, wherein each value of the single output vector is a Boolean attribute whose value for a given tuple is true if a current value and a most recent prior value of any of the one or more attributes are different.

Abstract: A first quicksort is performed in parallel across pairs of partitions of a dataset assigned to respective ones of available processors, including swapping elements of a first partition of a given one of the pairs that are larger than a pivot with elements of a second partition of the given pair that are smaller than the pivot. A second quicksort is performed in parallel across those partitions having elements left unsorted by the first quicksort, and first misplaced elements from a first side of the dataset corresponding to the first partition are swapped with second misplaced elements from a second side of the dataset corresponding to the second partition to produce a first dataset having elements equal to or lower than the pivot and a second dataset having elements equal to or higher than the pivot.

Abstract: The present disclosure relates to node deduplication based on a node merging policy. A plurality of node profiles may be maintained. Each node profile may include plurality of fields. Each field of the plurality of fields may include one or more values. For a node profile including one or more field-value pairs, each field-value pair may be identified. Each field-value pair may include a value of a field. A respective weight may be assigned to each field-value pair based on a number of field-value pairs or a confidence score. Based on the respective weights assigned to each field-value pair, it may be determined that node profiles satisfy a node profile merging policy. The node profiles may be merged based on the node profiles satisfying the node profile merging policy. Field-value pairs including a value of a field may be identified.

Abstract: The present disclosure describes methods, systems, and computer program products for providing pattern-based data source binding in OData services. One design-time computer-implemented method includes receiving an OData request from a requestor, traversing, by a computer, a rule table to determine whether an exact match for the received OData request exists in the rule table, upon a determination that an exact match for the received OData request exists in the rule table, forwarding the OData request to a bound data source specified in the rule table, and transmitting a result to the requestor following processing of the OData request by the bound data source.

Abstract: The invention concerns a query response device comprising: an input adapted to receive user queries; a memory (106) adapted to store one or more routing rules; one or more live agent engines (116) configured to support interactions with one or more live agents; one or more virtual assistant engines (120) configured to support interactions with one or more virtual assistants instantiated by an artificial intelligence module (103); and a routing module (104) coupled to said live agent engines and to said virtual assistant engines, the routing module comprising a processing device configured: to select, based on content of at least a first user message from a first user relating to a first user query and on said one or more routing rules, a first of said live agent engines or a first of said virtual assistant engines; and to route one or more further user messages relating to the first user query to the selected engine.

Abstract: Exemplary embodiments relate to techniques for determining social networking or messaging user affinity and engagement coefficients (e.g., a measure of the connectedness between two people in a network). The described techniques are particularly well-suited to cases in which only limited information is available, such as when a new user joins a network and only the user's contacts list is available. The available information may be used to determine a group of existing users to which the new user is connected. Some embodiments relate to calculating scores among these existing users in order to infer an affinity for the new user to the existing users. Other embodiments involve calculating bilateral scores that reflect a degree of mutual affinity between two users.

Abstract: A method for selectively modifying scores of youth-oriented content search results is disclosed. The method includes identifying a plurality of search results, with each search result being associated with one of a plurality of scores. The method further includes selecting a subset of search results from the plurality of search results, and selecting a subset of scores within the plurality of scores that includes scores associated with the selected subset of search results. The method further includes modifying each score of the subset of scores with a query-dependent factor.

Abstract: The provided solution makes it possible to select one item from a set of items, a multicomponent score being associated with each item of the set of items. After having computed a value characterising a relation ranking between a first item of the set of items and a second item of the set of items, the computed value being computed as a function of a plurality of score components associated with the first and second item of the set of items, respectively, the first item or of the second item is selected based on the computed value.

Abstract: Computer-implemented curriculum creation can include determining, using a processor, inquiries for educational content from data aggregated from a plurality of different users over time, determining, using the processor, topics of the inquiries, and categorizing, using the processor, the inquiries into groups based upon the topics. Computer-implemented curriculum creation may include searching, using the processor, for educational content for a subset of the topics, wherein the topics of the subset are selected based upon a ranking of the topics, and determining, using the processor, whether educational content is available for the topics of the subset based upon results of the searching.

Abstract: An information processing system includes a storing unit that stores evaluation data in which a plurality of subjects are associated with a plurality of evaluation expressions respectively and evaluation expression relationship data indicating relationships between the evaluation expressions, a question generating unit that generates and outputs questions on the basis of the evaluation data and the evaluation expression relationship data, and a matching unit that outputs information relating to the subject included in the evaluation data on the basis of responses when the responses with respect to the questions are input.

Abstract: The present application provides a method for recommending a teacher to a target student in a network teaching system. The method comprises: obtaining characteristic information of the target student; retrieving at least one candidate teacher from a teacher database according to the characteristic information of the target student, so as to obtain a candidate teacher list including the at least one candidate teacher; calculating, for the target student, a probability of reserving a course provided by each candidate teacher in the candidate teacher list; and ranking the at least one candidate teacher in the candidate teacher list based on the calculated probability and providing the target student with the ranked candidate teacher list.

Abstract: A compute cloud hosts a distributed application and is configured to add or remove instances of the application at datacenters at disperse geographic regions. Operations of the application are captured in a telemetry stream. Each record in the telemetry stream indicates a time, client location, and performance measure for a corresponding client request. After pre-processing such as rounding the times, the telemetry records are passed to a frequent itemset mining algorithm that identifies frequent time-location pairs in the telemetry stream. The frequent time-location pairs are consolidated into encompassing frequent region time-range pairs. An aggregate performance measure is computed from the performance measures of the telemetry records that match a frequent region time-range pair. A recommended region and time for adding or removing instances of the application is computed based on the aggregate performance measure and the region time-range pair.

Abstract: The present invention is related to a method for routing requests among a plurality of database servers. A device intermediary to a client and a plurality of database servers receives a request to access a database provided by the plurality of database servers. The plurality of database servers can include a first database server configured to process write requests and one or more second database servers configured to process read requests. The device determines that the request to access the database is a read request. The device identifies, responsive to determining that the request is a read request, one of the one or more second database servers to send the request instead of the first database server. The device then transmits the request to the identified second database server.

Abstract: Methods and apparatus are provided for repairing vehicles. A computing device having first and second software executables can determine vehicle identification information (VII) that identifies a vehicle. The computing device can store first and second vehicle identifiers that are based on the VII and are respectively associated with the first and second software executables, where the first vehicle identifier differs from the second vehicle identifier. The computing device can be used to repair the vehicle by at least: receiving a request to activate the first software executable, and activating the first software executable at least by providing the stored first vehicle identifier to the first software executable.

Abstract: Filtering apparatus and methods associated with filtering large time series of data are described. A filtering process containing recursive dependencies can be organized as a series of computational tasks, at least some of which can be performed in parallel. Because of parallel execution of some tasks, an amount of time for filtering large time series of data with a filter exhibiting recursive data dependencies can be reduced significantly.

Abstract: In some example embodiments, a system is provided for executing a primitive call that implements a query operation. The system may include a data processor and a memory. The memory may store instructions that result in operations when executed by the data processor. The operations may include: executing, at an data management engine, the primitive call by at least performing a first operation with respect to a value identifier set, the value identifier set including one or more value identifiers, and the primitive call being configured to access a database storing a plurality of value identifiers; and generating, based at least on a result of the first operation, a result for the primitive call. Related methods and articles of manufacture, including computer program products, are also described.

Abstract: In some implementations, a processing system of a database system may identify identification information associated with a user within a request, received from a client device, for data associated with the user, compare the identification information with user identity entries persisting on the memory device, determine, from the comparison, that a user identity entry persisting on the memory device is associated with the user, and query a backend database associated with the client device with one or more parameters included within the user identity entry to obtain the data associated with the user.

Abstract: Embodiments relate to processing a data set stored in a computer system. In one aspect, a method of processing a data set stored in a computer system includes providing one or more parameters for quantifying data quality of the data set. A processor generates, for each parameter of the one or more parameters, a reference pattern indicating a dysfunctional behavior of the values of the parameter. The data set is processed to obtain values of the one or more parameters. A parameter of the one or more parameters is identified whose obtained values match a corresponding reference pattern of the generated reference patterns. The identified parameter is assigned a resource weight value indicating the amount of processing resources required to fix the dysfunctional behavior of the identified parameter.

Abstract: A system and method are disclosed for private cloud computing and for the development and deployment of cloud applications in the private cloud. The private cloud computing system and method of the present invention include as components at least a cloud controller, a cloud stack, Service Registry, and a cloud application builder.

Abstract: A computer-executed method includes storing in a data store data attributes, data objects, a data analysis tool (DAT), and render functions. Each data object has an attribute set and an identifier set. The method includes identifying each data object that has an attribute set comprising a data attribute matching each reference data attribute associated with the DAT, and selecting an identified data object as an input data object for the DAT. The DAT generates a new data object as a function of the input data object, which includes analyzing the input data object with reference to an auxiliary data object and creating an identifier set for the new data object that includes an identifier of the new data object for distinguishing the new data object from each other data object in the data store, and the identifier of the auxiliary data object. The new data object is stored in the data store. Each render function is associated with a set of reference data attributes.

Abstract: A database includes a run-time database container, which provides an isolated computing environment for a database object deployed therein. The database further includes a public synonym object outside the run-time database container in the database. The public synonym object is associated with the database object deployed inside the run-time database container and provides external access to the database object deployed inside the run-time database container independent of the location of the run-time database container.

Abstract: A system, a method, and a non-transitory computer readable for generating a profile of one or more data objects comprising determining a format of the at least one data object and selecting a data transformation policy based on the format of the at least one data object and generating a model descriptive of the non-structured data contained in the at least one data object based on the data transformation policy and selecting at least a portion of the model indicative of a portion of the non-structured data and generating a profile of the portion of the non-structured data contained in all of the one or more data objects.

Abstract: The methods and system disclose an automated pipeline which receives a list of Accession IDs corresponding to transcriptomic, proteomic, genomic, or metabolomic data. Each Accession ID is submitted in parallel, launching a specific cloud computer to carry out a customized, fully automated transcriptome assembly (or proteomic assembly or genome assembly or metabolome assembly) and analysis by the automated pipeline. The output from multiple assemblies is automatically compiled and compared with genes of interest to identify new gene variants. The new gene variants can be used as queries by the automated pipeline to: discover variants of the variants; and determine new studies to analyze.

Abstract: A computer system and method for performing 3D geolocation within an urban environment to at least a building floor level by combining geocoded locations with local dimensional data available from municipal agencies processed to calculate estimated elevation of building floors in a target building. The local dimensional data is building inventory information that includes the ground elevation of the target building, the number of above-ground floors in the target building and the height of the target building. The system is configured to calculate the building floor level of a particular floor in the target building from the local data. Standard equations for estimating the height of a building are adapted to generate the elevation of the particular floor within the target building relative to the ground elevation of the target building.

Abstract: Technology is disclosed for transmitting notification updates to computing devices (“the technology”). Various embodiments of the technology includes a proxy server that facilitates transmission of notifications to the computing devices based on a location proximity and/or access pattern of the computing devices. In one such embodiment, if a particular computing device of the user is not within a predefined location proximity of a primary computing device of the user, the proxy server delays or decreases the frequency of transmission of the notifications to the particular mobile device. In another example, based on the access pattern of the particular computing device, if the proxy server determines that the user is not likely to use the particular computing device, e.g. until a certain point of time, the proxy server delays or decreases the frequency of the transmission of the notifications to the particular mobile device until around that certain point of time.

Abstract: A storage system comprises: a controller; a memory; one or more objects, each object having content data and metadata which includes system metadata; and a policy which governs writing of the content data and metadata of the one or more objects from the storage system to an external storage. The policy includes a configurable criterion for decoupling of the content data and the metadata of a given object and a rule for determining storage locations for the content data and the metadata between the storage system and the external storage in a decoupled manner if the content data and the metadata of the object are decoupled. The configurable criterion is based on an attribute of the metadata of the object. The controller is operable to execute the policy against the objects and to apply the rule to determine storage locations for the content data and metadata of a decoupled object.

Abstract: Provided herein is an In-Memory DB connection support type scheduling method and system for real-time big data analysis in distributed computing environment. The data processing method according to an embodiment of the present disclosure analyzes data based on a distributed computing environment using a distributed system and dynamically alters a structure of a distributed DB constituting the distributed system based on the distributed computing environment. By this method, it is possible to secure concurrency adaptively to the distributed computing environment by dynamically managing the number of shards, and secure real-timeliness through TMO-based scheduling, thereby ultimately improving the speed/efficiency of big data analysis.

Abstract: A method implemented by at least one processing device, a processing device, and a computer program product are provided for adjusting hash partitions for a hash join operation. An amount of rows within each of an initial number of hash partitions is determined during assignment of respective rows to respective hash partitions. The initial number of hash partitions is adjusted to a final number of hash partitions based on the amount of rows within each of the initial number of hash partitions and an amount of available memory. The adjusting further includes determining the final number of hash partitions based on the amount of rows within each of the initial number of hash partitions and the amount of available memory, and assigning the rows to the final number of hash partitions. The hash join operation is then performed.

Abstract: A client can allocate identifiers to local content items and ensure the identifiers are unique at a content management system. For example, a client can add a first content item at a first path and determine the first content item does not have a first unique identifier. The client can determine that a second content item at a second path was previously associated with the first path and determine that the first content item should inherit a second unique identifier from the second content item. The client can then assign the second unique identifier to the first content item and add a node representing the first content item to a local tree representing a local state of content items at the client, the node including the second unique identifier. The client can also upload the first content item with the second unique identifier to the content management system.

Abstract: Updates to a hierarchical data structure may be selectively replicated to other replicas of the hierarchical data structure. An update for a hierarchical data structure may be received and committed to the hierarchical data structure. A determination as to whether any other replicas of the hierarchical data structure have permission to receive the update may be made. For those replicas of the hierarchical data structure with permission to receive the update, the update may be provided to the replicas and committed to the replicas. Different types of replication techniques may be implemented, such as pull-based replication techniques or push-based replication techniques. Replication permissions for objects of the hierarchical data structure may be individually defined, in some embodiments.

Abstract: A device implementing adaptive, cross-device event data synchronization includes at least one processor to maintain a database on the device, the database storing event data items derived from user data items corresponding to user activity on the device or a second device. The at least one processor periodically transmits, to a server, first insertion records corresponding to new event data items generated at the device, the transmission periodicity based on a frequency at which the new event data items are generated. The at least one processor, upon detecting deletion of one user data item, deletes, from the database, one corresponding event data item, and immediately transmits, to the server for propagation to the second device, a first deletion record for deletion of one corresponding event data item at the second device, the first deletion record being transmitted along with any of the first insertion records awaiting transmission.

Abstract: An automated method and computer program product are provided for synchronizing a column-oriented target database with a row-oriented source database. Change data are replicated from a change log of the row-oriented source database via a staging database to the column-oriented target database. The change data including inserts and deletes. Change data of the change log is read into the staging database and is consolidated and grouped into a consolidated grouping of inserts, and a consolidated grouping of deletes. The consolidated grouping of inserts from the staging database are applied to the target database in a batched manner, and the consolidated grouping of deletes from the staging database are applied to the target database in a batched manner.

Abstract: A method, system and computer program product for copying data from a source database to a target database. A first database engine of the source database assigns a data-change-ID to each changed row in the source table. The data rows of the source table are stored in a plurality of source pages. Each source page comprises a source-page-ID and a highest-data-change-ID indicating its most recently changed data row. The target table comprises a source-page-ID-column. A second database engine of the target database maintains a metadata table comprising a source-page-ID column and a highest-data-change-ID column. The highest-data-change-IDs in the metadata table are compared with the highest-data-change-IDs of the source pages for selectively copying source table rows of source pages whose highest-data-change-ID is higher than their highest-data-change-ID in the metadata table to the target table.