Abstract: Techniques are disclosed for comparing database tables. In one embodiment, the database tables are partitioned. Queries are generated for retrieving each partition. For each generated query, a stored procedure is invoked, using the respective generated query as an input parameter to the stored procedure. The stored procedure is configured to generate a checksum based on the partition retrieved from executing the respective query. The application compares the generated checksums to determine if the partitions and/or tables are consistent.

Abstract: Methods and systems are disclosed for detecting data divergence or inconsistency across replicas of data maintained in replica nodes in a shared-nothing distributed computer database system. The replica nodes communicate with a coordinator node over a computer network. The method includes the steps of: (a) receiving an operation at the coordinator node; (b) transmitting the operation to the replica nodes to be executed by each replica node to generate an operation result and a hash representation of the operation or of the operation result; (c) receiving the operation result and the hash representation generated by each of the replica nodes; and (d) determining whether the operation resulted in data divergence or inconsistency by detecting when the hash representations received from the replica nodes are not all the same.

Abstract: For efficient calculation of both similarity search values and boundaries of digest blocks in data deduplication, input data is partitioned into chunks, and for each chunk a set of rolling hash values is calculated. A single linear scan of the rolling hash values is used to produce both similarity search values and boundaries of the digest blocks of the chunk. The rolling hash values are used to contribute to the calculation of the similarity search values and to the calculation of the boundaries of the digest blocks.

Abstract: In an approach to providing completion support and on demand validation in a web tool that operates on live resources, one or more computer processors create one or more lists of content, where the one or more lists of content include one or more references to one or more runtime objects. The one or more computer processors parse the one or more lists of content. The one or more computer processors populate one or more lists of one or more choices with the parsed one or more lists of content. The one or more computer processors create one or more callbacks for one or more runtime objects referenced by the one or more lists of one or more choices.

Abstract: A method for inserting rows into a target table can include receiving a database command, the database command associated with a base table with at least one row to copy to a target table; receiving an indication that use of a BULK insert mode is feasible for the database command; based on the indication, and determining that an insert mode for the database command has been converted from a non-bulk insert mode to the BULK insert mode: reading a row from the base table; building the row read from the base table into an allocated row buffer; inserting the row into the target table in the BULK insert mode; and if it is determined that the allocated row buffer is full, updating at least one index in parallel with the inserting.

Abstract: Methods and systems for presenting online content elements based on information caused to be stored on a communication apparatus by a service provider. One of the methods is a method for presenting online content at a communication apparatus. The method comprises: obtaining information caused to be stored on the communication apparatus by a service provider providing network access to the communication apparatus, the information pertaining to a profile maintained by the service provider; determining an online content element to be presented at the communication apparatus based on the information; and causing the communication apparatus to present the online content element. The online content element may be an advertising content element forming an online advertisement, a primary content element of a network site, or an online page. The information may include location information, personal information, and/or bandwidth information. Servers for implementing the methods are also provided.

Abstract: A computer system includes a processor. The processor is configured to provide a documented screenshot and a machine-executable indication of steps which generated the documented screenshot as contained in documentation. The processor also will execute the steps which generated the documented screenshot, to generate a current screenshot. The processor also will compare the documented screenshot as contained in the documentation to the current screenshot generated by executing the steps, to provide a determination whether the comparison shows differences between the documented screenshot and the current screenshot. A method according to the above will detect changes to a screenshot used in documentation. A non-transitory computer-readable medium can perform a method to detect changes to a screenshot used in documentation.

Abstract: A method for managing prospective search queries is provided. A first prospective search query is received. A first sample data set is determined based on a union of the first prospective search query and a second prospective search query. An indication that the first prospective search query is not mutually exclusive with the second prospective search query is provided if the first sample data set matches the second prospective search query.

Abstract: A method for managing tags in a tag cloud may include receiving a tag for an object and comparing the tag to existing tags for the object. The comparing may include determining if there is a relationship between the tag and any of the existing tags. The method may also include adding the tag to the tag cloud in response to there being no relationship between the tag and any of the existing tags. The method may additionally include selecting one tag of the existing tags in response to the tag and the one tag being related tags. The method may further include presenting the related tags in the tag cloud. Presenting the related tags in the tag cloud may include at least one of modifying the one tag in the tag cloud, indicating the tags are related, and combining the related tags into a single tag.

Abstract: Techniques are described for performing grouping and aggregation operations. In an embodiment, a request is received to aggregate data grouped by a first column. In response to receiving the request, values are loaded from the first column into an input cache. The values include values, from the first column, from a set of rows. A filter unit is programmed with logic to perform a comparison between a particular value, from the first column of a first row, and values in the first column of a plurality of rows, of the set of rows. Based on the comparison, a predicate result is generated that identifies rows, within the plurality of rows, that have a valued in the first column that matches the particular value. An aggregate value for a second column is generated by aggregating values, from the second column, of each of the rows identified by the predicate result.

Abstract: A mechanism for efficient collection of data is described for runtime middleware environments. Two frequencies are used, a collection frequency (CF) to collect the data and an aggregation frequency (AF) to aggregate and persist the data in a repository. The collection cycle is a shorter time interval than the aggregation cycle. An agent residing in the container periodically collects a set of data upon every collection cycle from the components of the middleware system and caches the set of data locally. Upon every aggregation cycle, the agent applies an aggregation function to the collected set of data and persists the set of data into a repository after the aggregation function has been applied. The aggregation function is such that it resulting data represents the behavior of the runtime environment in the total duration of the aggregation cycle.

Abstract: A method of non-identical feature matching in a search system, the search system having a set of data points. The method includes determining a threshold error and expanding the set to create an expanded set by including all data points as data elements of the expanded set and, for every data point in the set, finding all data elements within an error distance of that data point and adding those found data elements to the expanded set, wherein the error distance is a function of the threshold error. The method includes creating a summary representation of the expanded set by constructing a binary array using a plurality of hash functions as a bloom filter. The method may further include receiving a query and applying the plurality of hash functions to the query to determine, from the binary array, whether the query matches one of the data elements in the expanded set and, if so, outputting a match.

Abstract: Joining sets of tables on a join attribute using a predefined amount of memory. A set of tables is stored on disk storage. The largest table is a streaming table. The remaining tables form a subset of tables. For each subset table, a hash table is generated, resulting in a subset of hash tables. A group of not yet joined hash tables is determined such that the size of the tables is smaller than the amount of memory. The tables are loaded to the memory. A hash join is performed between the streaming table and the group of tables, forming a temporal joined table. If the subset includes a not yet joined table with the streaming table, a further set of tables with the not yet joined and the temporal joined table is formed. The above operations are repeated using the further set of tables as the set of tables.

Abstract: Concepts and technologies are disclosed herein for generating and using temporal data partition revisions. In some embodiments, a server computer can execute a data management application. The server computer can obtain a data partition associated with a data stream. The data partition can include a data point and a timestamp. The server computer can analyze the timestamp to determine if the data partition corresponds to an update of a base data record. If the server computer determines that the data corresponds to an update, the server computer can compute a revision comprising a delta and a timestamp and store the revision.

Abstract: Embodiments of the disclosure provide a method, system, and computer program product for managing a windowing operation. The method can include determining a sentinel value that defines a start of a grouping window for a stream of tuples and a terminating sentinel value that defines the end of the grouping window based upon an attribute contained in the stream of tuples. The stream of tuples can be monitored for the sentinel value and the terminating sentinel value by a stream operator. The stream operator can initiate a windowing operation that defines the start of the grouping window in response to a presence of the sentinel value and terminate the windowing operation in response to a presence of the terminating sentinel value.

Abstract: A method for automatically forming the clearest and most useful visual plot for a given dataset of tuples. A best view type is selected for a view that includes a subsequently added new field. The visual plot is populated with the data in the view and then automatically rendered for the user. A dataset that is retrieved from a storage is analyzed to identify all the data types found in the dataset, and to determine the best view type to assign to the dataset's views. The visual plot is then populated with the data according to this best view type, and is automatically rendered for the user.

Abstract: Systems and methods are disclosed herein for providing search results, particularly product records from a product database. Tokens of a query are identified. Product records including one or more tokens in values associated with the attributes thereof are identified. A score is generated for attributes of products including a token (an attribute-token score). The attribute-token score is based on a frequency of occurrence of the token in the attribute value and a length of the attribute value in which it occurs. The attribute-token scores for the token are summed to generated a score. The token score for a token may be scaled in a non-linear fashion such that the scaled value approaches a saturation value, which may be an inverse document frequency (IDF) score for the token. The scaled values may then be summed to generate a score for the document that is used to rank the search results.

Abstract: Techniques are disclosed for maintaining a search index used to support application searches. The techniques include receiving application data from one or more data sources, identifying an application referenced in the application data. The techniques further include extracting a plurality of attributes corresponding to the application from the application data based on an application specific search schema. The techniques also include generating an application representation of the application based on the plurality of attributes and the application specific search schema. The techniques also include updating a search index with the application representation.

Abstract: Embodiments for presenting search content is provided herein. An embodiment includes, receiving an input string in a browser input receiver, presenting a list of identifiers and search queries, wherein at least a portion of each of the identifiers and search queries match the input string, and presenting one or more search results associated with a selected search query on a display or providing a HTTP request to retrieve content associated with a selected identifier, and presenting the content on the display.

Abstract: Embodiments of the invention form an information set from the current set of index information available by the operations of the pre-search and runtime Search components of the search engine. A search request that contains search terms and/or other search criteria (e.g. date or file type) is entered by a user through an input interface. The search terms and the information set are worked through the search engine modules to provide the actual results sought by the user. These results are provided to the user via an output interface. Embodiments involve converting a search request into a format of an index of documents, and then comparing the converted search request and the index for matches.

Abstract: A computer-implemented system and process for generating video search engine results page is disclosed. The system provides a query term and retrieves a collection of search results. Tags are generated for each search result and used to match media objects to each search result. The search results and video objects related to each search result are returned as a video search engine results page.

Abstract: Resolving a query term includes receiving at least one query term from a requestor and determining a geographic location of the requestor. The geographic location of the requestor may be determined by accessing an electronic information store containing a requestor profile including geographic information about the requestor, where the requestor profile is used by more than one program. The query term is resolved against electronic information within at least one electronic information store to determine whether one or more matches exist and a result is generated that accounts for the geographic location of the requestor.

Abstract: In various example embodiments, a system and method for limiting shares of voice of individual users in a result set are provided. In example embodiments, an entity providing each entry in a result set of a search is identified. Sorting criteria including a size rule that includes a sort size value defining a maximum number of consecutive publications from a same entity are retrieved. A sorted result set is generated in compliance with the sorting criteria by shifting a publication from the same entity down one or more positions in order to satisfy the sorting criteria. The sorted result set is provided to a searching user.

Abstract: A method determining one or more causes for discrepancies in a computerized accounting system, the method comprising using at least one hardware processor for: providing a set of theoretical causes for discrepancies between sub-ledgers of an ERP (Enterprise Resource Planning) system and a general ledger of the ERP system; providing a set of database queries corresponding to the theoretical causes in the set of theoretical causes; executing the database queries of the a set of database queries in the ERP system; receiving a set of responses to the database queries; and based on the set of responses, refuting or confirming each of the theoretical causes of the set of theoretical causes.

Abstract: A method for detecting and locating occurrence in a data stream of any complex string belonging to a predefined complex dictionary is disclosed. A complex string may comprise an arbitrary number of interleaving coherent strings and ambiguous strings. The method comprises a first process for transforming the complex dictionary into a simple structure to enable continuously conducting computationally efficient search, and a second process for examining received data in real time using the simple structure. The method may be implemented as an article of manufacture having a processor-readable storage medium having instructions stored thereon for execution by a processor, causing the processor to match examined data to an object complex string belonging to the complex dictionary, where the matching process is based on equality to constituent coherent strings, and congruence to ambiguous strings, of the object complex string.

Abstract: A computer-implemented method for managing large volumes of data comprises dividing data about a number of features into a plurality of data groups, each of the groups having a plurality of features, each of the features having a plurality of properties, and each of the properties having a property value; for each of the groups, determining a number of distribution ranges for the property values for each of the properties; for each of the groups, determining a number of features having property values that are within each of the distribution ranges; and generating a summary associated with each of the groups, the summary comprising the properties of the features in the group and the number of the features that are within each of the distribution ranges for the properties.

Abstract: Cross tabulation operation is performed within a columnar database management system. The columnar database management system receives a request to perform a cross-tabulation operation on a set of database tables. The columnar database management system determines values of cross tabulation operation for each row of the result. The columnar database management system determines a domain for each value of the row dimension corresponding to a row combination. The columnar database management system determines an intersection set of the domains corresponding to values of the row dimensions for the row combination. The columnar database management system determines a value for the result column for the row combination as an aggregate value based on the records of the intersection set.

Abstract: Event data collected for a given event is obtained, wherein the event data comprises a plurality of time series data sets. The plurality of time series data sets are divided into a set of time windows (e.g., epochs). Data in the plurality of time series data sets occurring within each time window of the set of time windows is aligned. A metric is computed for each aligned time window, wherein the metric for each aligned time window represents a measure of at least one of completeness and support attributable to data in the aligned time window. Data is pruned from the set of event data for one or more of the set of time windows based on the computed metrics. The pruned event data is provided to a data analytics process which is configured to further process the pruned event data.

Abstract: Provided is a method of processing and analyzing vehicle driving big data, the method including: refining vehicle driving data of raw data; acquiring statistical data based on the refined vehicle driving data; and performing mining analysis based on at least one of the refined vehicle driving data and the acquired statistical data.

Abstract: The present disclosure describes methods, systems, and computer program products for performing fuzzy substring search. One computer-implemented method includes determining, by operation of a hardware processor, one or more tokens of an input string received from a client application, identifying, from a database, a reference string based on the one or more tokens of the input string, determining a plurality of character index values of the reference string, each character index value indicating a position of a character in the reference string, determining one or more hop index values of the input string, each hop index value indicating a position of a separator in the input string, and calculating a similarity score of the reference string relative to the input string based on the plurality of character index values of the reference string and the one or more hop index values of the input string.

Abstract: In one aspect, a method includes receiving an indication of a request from a user to view a stream associated with the user, generating a request for one or more items visible to the user for display within the stream, the request including a search query identifying search criteria including one or more tokens, the one or more tokens including at least a user token identifying the user, receiving one or more items in response to the request, the one or more items including at least one of the one or more tokens and further being visible to the user and providing the one or more items for display to the user within the stream in response to the request. Other aspects can be embodied in corresponding systems and apparatus, including computer program products.

Abstract: Methods, apparatuses and computer program products are provided for displaying search results and other points of interest located on multiple floors or levels in a multi-level map. A method may include receiving an input indicating a search criteria. Further, the method may include determining at least one search result position related to the search criteria, and determining a relationship between the at least one search result position and a multi-level map. In addition, the method may further comprise causing, based at least in part on the relationship, a level of the map and the at least one search result position to be displayed as a search result position indicator, wherein the displayed search result position indicator may be presented in a different manners based at least in part on what level the search result position is located. Corresponding apparatuses and computer program products are also provided.

Abstract: A method and system that enables data to be shared across application systems via a table substitution scheme. Tables are identified in the legacy application system that are candidates for substitution of tables in the core application system containing similar data. Table structure meta data corresponding to these “substituted” tables are then extracted from the legacy system schema, and stored in a repository. In accordance with the meta data, business logic is defined to remap columns in the core tables to corresponding columns in the substituted tables. Accordingly, when the core application system performs data access (e.g., reads, inserts, updates, etc.), it accesses the remapped columns in the substituted tables instead of original columns in the core tables. At the same time, the legacy application system is enabled to concurrently access the substituted tables without require any changes to the business logic of the legacy application system.

Abstract: A system and method for marshaling database data from a native interface layer, to a Java layer, using a linear array. In accordance with an embodiment, a request is received from a software application to query or access data stored at the database. At a database driver native interface layer, the system obtains cell data from the database, determines cell coordinates and a cell metadata, and linearizes the cell data if required. The linearized data is then flushed to a linear byte array in the database driver presentation layer, and the cell coordinates and cell metadata are provided for use by a compact data handler and the application in accessing the data.

Abstract: Techniques are disclosed for consuming and integrating with representational state transfer (REST) based services. In one embodiment, a multiple-step extract, transform, load (ETL) job includes one or more REST steps. Each step in the ETL job performs a particular well-defined task, and the REST step in particular constructs REST requests, invokes REST services, and retrieves REST responses. The REST step may be mapped to a vector of inputs such that multiple REST service calls are made for each of the inputs. Further, a reusable connection may be employed so that one connection can be used to make multiple REST service calls. URLs used to make REST service calls may be dynamically constructed based on input data parameters and ETL job parameters. Additionally, a graphical user interface (GUI) allows users to configure aspects of a REST step.

Abstract: A predicate-based row level security system is used when workers build or split an analytical data store. According to one implementation, predicate-based means that security requirements of source transactional systems can be used as predicates to a rule base that generates one or more security tokens, which are associated with each row as attributes of a dimension. Similarly, when an analytic data store is to be split, build job, user and session attributes can be used to generate complementary security tokens that are compared to security tokens of selected rows. Efficient indexing of a security tokens dimension makes it efficient to qualify row retrieval based on security criteria.

Abstract: In one embodiment, a system is provided. The system includes a first client. The system also includes an analysis server coupled to the first client. The system further includes a first customer database of information coupled to the analysis server. The first customer database is to embody forecast data and to receive essentially real-time updates to the forecast data. The first customer database supports an OLAP cube associated with the analysis server.

Abstract: A computer system identifies high-value information in data streams. The computer system receives a filter graph definition. The filter graph definition includes a plurality of filter nodes, each filter node including one or more filters that accept or reject packets. Each respective filter is categorized by a number of operations, and the one or more filters are arranged in a general graph. The computer system performs one or more optimization operations, including: determining if a closed circuit exists within the graph, and when the closed circuit exists within the graph, removing the closed circuit; reordering the filters based at least in part on the number of operations; and parallelizing the general graph such that the one or more filters are configured to be executed on one or more processors.

Abstract: First logical cores supported on physical processor cores in a computing system can be designated for execution of message-passing workers of a plurality of message workers while at least second logical cores supported on the physical processor cores can be designated for execution of procedural code such that resources of a physical processor core supporting the first logical core and the second logical core are shared between a first logical core and a second logical core. A database object in a repository can be assigned to one message-passing worker, which can execute operations on the database object while procedurally coded operations are processed using the second logical core on one or more of the plurality of physical processor cores while the first logical core executes the message-passing worker.

Abstract: Techniques for a method for automatically synchronizing application state across multiple devices are disclosed herein. The method includes running an instance of a computer application at a first electronic device, detecting a presence of a second electronic device based on a proximity of the second electronic device to the first electronic device, identifying an installation of another instance of the computer application on the second electronic device, and transmitting an application state data to the second electronic device. The application state data represents an application state of the computer application at the first electronic device. The application state data of the computer application enables another instance of the computer application at the second electronic device to resume running the computer application from the transmitted application state.

Abstract: Various systems and methods for dividing, accessing, and sending portions of a data structure from one node to another for replication from a primary site to a secondary site are disclosed. The method includes dividing a data structure into portions. The data structure stores information identifying which regions of a data volume have been modified and nodes in a cluster share access to the data volume. The nodes and the data volume are located at the primary site. The method also includes sending a first portion of the data structure to a second node in the cluster. The sending causes the second node to replicate the data identified in the portion of the data structure from the data volume to the secondary site. In one embodiment, the accessing and the sending are performed by a logowner node.

Abstract: The present disclosure provides improved systems, methods, and computer program products suited to address the issues with legacy approaches. Specifically, the present disclosure provides a detailed description of techniques used in systems, methods, and in computer program products for interpreting relational database statements using a virtual multidimensional data model.

Abstract: Systems and methods are disclosed for object-based commands and functions. In an embodiment, an apparatus may comprise a data storage device configured to store data as variable-size objects, each object including a tracking indicator to identify the object, and to receive a command including an operation directed to an object and an indicator that specifies a variation of the operation to be performed. Tracking indicators may be selected by a host, and may have specific organization meaning to the host. A tenant accessing the data storage device may be restricted to accessing objects within one or more specific ranges of tracking indicators.

Abstract: An apparatus is described comprising at least one processor; and memory storing instructions that, when executed by the at least one processor, cause the apparatus to: organize items of raw data received from at least one sensor of a vehicle as a first data structure, organize classified data objects as a second data structure, and link at least one item of the first data structure to at least one object of the second data structure.

Abstract: A computer implemented method can determine validity of web-based interactions. Web-based interaction data relating to a web-based interaction may be accessed. The web-based interaction data may include aggregate measure data that may include a number of unique queries per web-based session. The validity of the web-based interaction may be determined based on the aggregate measure data.

Abstract: Managing placement of object replicas is performed at a first instance of a distributed storage system. One or more journals are opened for storage of object chunks. Each journal is associated with a single placement policy. A first object is received comprising at least a first object chunk. The first object is associated with a first placement policy. The first object chunk is stored in a first journal whose associated placement policy matches the first placement policy. The first journal stores only object chunks for objects whose placement policies match the first placement policy. For the first journal, the receiving and storing operations are repeated for multiple objects whose associated placement policies match the first placement policy, until a first termination condition occurs. Then, the first journal is closed. Subsequently, the first journal is replicated to a second instance of the distributed storage system according to the first placement policy.

Abstract: Embodiments relate to a method, system, and computer program product for database aggregation operations. The method includes acquiring data located in data pages of extents and performing a database aggregation operation pre-processing on the acquired data. The method also includes storing the result of said pre-processing in summary data pages, the summary data pages being used for performing database aggregation operations rapidly.

Abstract: To associate a keyword with a category having a high degree of relevance with the keyword. An association apparatus comprises an acquisition means that acquires the number of times when each of a plurality of categories of a search target is designated as a search condition together with a keyword, and a registration means that registers category information indicating the category for which the number of times acquired by the acquisition means is a threshold or more, and the keyword in an associated manner.

Abstract: A computer-implemented system and method for generating an interest profile for a user from user generated content on existing online profiles is provided. Interest categories are maintained in a database and each interest category is associated with an initial interest index score. User generated items are selected from an existing online profile and each user generated item is associated with a weight. For each user generated item, similarity mapping is performed with each of the interest categories in the database by extracting artifacts from each user generated item, calculating an artifact similarity score for each of the extracted artifacts, obtaining a user generated item similarity score for the user generated item, and determining a current interest index score for the user generated item. An interest profile for the user is generated by applying the current interest index score to the interest category.

Abstract: Embodiments of the present disclosure relate to the field of database technology. More specifically, embodiments of the present disclosure relate to a method and system for importing E-R model data utilizing dependency information in an E-R model data schema. This disclosure provides a method for importing E-R model data, comprising: receiving an imported E-R model data file and a data schema of the E-R model; determining a dependency type of each entity in the data file based on the data schema, wherein the dependency type corresponds to at least one of no correlation, weak correlation, or strong correlation; and correspondingly importing each entity in the E-R model data file based on the determined dependency type.