Abstract: A recommendation engine may provide recommendations by obtaining a compact graph representation representing a recommendations graph comprising of nodes and weighted edges. Each node is associated with type metadata indicating that it represents a recommendable item or a non-recommendable item. Each weighted edge is associated with edge-weight metadata. The compact graph representation can be stored in primary memory. When servicing a request for an item recommendation, the recommendation engine selects an entry node based at least in part on context metadata associated with the request, and traverses only a highly-weighted portion of the compact graph representation that is proximate to an entry node to select paths leading respectively to potential recommendation nodes. Each path is scored based on the edge-weight metadata of all segments, and at least one recommendation node is selected based at least in part on the path scores.

Abstract: Methods and systems are directed to controlling access to data in a production environment. Production data may be stored in a production database and test data may be stored in a test database. A production application may have access only to the data in the production database while a test application may have access to both the production database and the test database. The test application may have read-only access to the production database and read-write access to the test database. Data in the test database may be handled differently than data in the production database. A type of data may be associated with a range of valid values. The values assigned to the elements may differ depending on whether the elements are stored in the production database or the test database.

Abstract: Embodiments of the present invention disclose a method, a computer program product, and a computer system for suspending and activating a database index. A computer determines a quantity of changes for a number of rows of a database that are to be made by an update of the database. The computer determines whether to suspend an index of the database based, at least in part, on a comparison between the quantity of changes and a pre-determined threshold value. The computer suspends the index of the database based on a result of the comparison that indicates the quantity of changes at least meet the pre-determined threshold value. A suspension of the index of the database initiates a rebuilding of the index.

Abstract: The present disclosure provides various systems and methods for indexing digital (electronic) documents and providing various error reporting and identification functions. The systems and methods may utilize various software, hardware, and firmware modules to identify notations, such as primary sheet names and reference sheet names on construction documents. Various algorithms and methods may be employed to identify errors, erroneous notations, missing sheets, missing details, and/or the like to aid in the correction of construction documents. Identified notations are indexed and may be used to create hyperlinked and/or backlinked notations in output files.

Abstract: A method and system for maintaining a density-based geocode tree for a geographic area, including obtaining a geocode tree including multiple leaf nodes each having a geohash value corresponding to a subdivision of the geographic area, obtaining multiple positions within the geographic area, generating, using the multiple positions, multiple geohashes, mapping a first subset of the multiple geohashes to a first leaf node of the multiple leaf nodes based on the geohash value of the first leaf node, incrementing, by a cardinality of the first subset, a first counter value for the first leaf node, and grafting, in response to the first counter value exceeding a first density threshold, at least one child node onto the first leaf node.

Abstract: A method can include receiving a request to execute a database command identifying a target table; identifying a plurality of rows to insert into the target table based in part on the database command; writing rows, from the plurality of rows, into a data page until the data page is full; determining, by an index thread manager, a number of threads to use for updating indexes defined for the target table; and upon determining the data page is full, updating, in parallel, the indexes defined for the target table using the number of threads.

Abstract: Methods and systems for partitioning and dynamically merging a database index are described. A database index includes a single first-level index partition stored in a data cache. As the first-level index partition in the data cache reaches a predetermined size, it is copied to secondary storage and a new index partition is generated in the data cache. When the number of index partitions in secondary storage reaches some predetermined number, the index partitions are merged to create a single index partition of a higher level in a hierarchy of index partitions having an exponentially increasing size with each increase in level within the hierarchy.

Abstract: A method of providing predictive search query recommendations for a search query. The method can be implemented via execution of computer instructions configured to run at one or more processing modules and configured to be stored at one or more non-transitory memory storage modules. The method can include receiving the search query from a user. The method also can include determining the predictive search query recommendations for the search query using a tree data structure. At least one top layer of the tree data structure can include at least one trie query node and bottom layers of the tree data structure can include ternary tree query nodes. The method further can include sending the predictive search query recommendations to the user. Other embodiments of related systems and methods are also disclosed.

Abstract: A computing system concurrently executes a builder thread and a reader thread. The builder thread modifies a document by modifying an active representation of the document. The reader thread perform operations regarding the document using a non-active representation of the document. The active representation of the document and the non-active representation of the document are stored in a memory of the computing system. The active representation of the document and the non-active representation of the document do not include different copies in the memory of the same data. When reading data in the non-active representation of the document, logical consistency is ensured without locking any data in the non-active representation of the document.

Abstract: Approaches for a user-driven warehousing approach are provided, wherein usage patterns for business intelligence applications are gathered, for example in an automated recording fashion, allowing the automated scheduling of jobs in a manner that prioritizes jobs that populate the most-used tables and scheduling those jobs in a manner to ensure that the data is up-to-date prior to when it is generally accessed. The usage pattern analysis also allows for the automated identification of more focused data marts for particular situations. The usage pattern analysis also provides for automated data warehouse/data mart creation and customization based on usage patterns that may be used as a seed, as well as for on-the-fly latitudinal analysis across prepackaged domain-specific applications.

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: Performing optimized update operations in in-memory database systems. Update values corresponding to a source table of values stored on an in-memory database are identified by an in-memory database computer system based on information from a computer system implementing a software application. The update values are distributed across a plurality of rows, each row including a plurality of column attributes. At least some column attributes of the plurality of column attributes include values updated relative to corresponding column attributes in the source table of values. A row of the update values is identified. The row includes a plurality of column attributes, each column attribute having a respective value. Each value of each column attribute of the row of the update values is the same as a corresponding value of a corresponding attribute of a corresponding row of the source table is determined.

Abstract: Techniques to improve query caching performance by efficiently selecting queries stored in a cache for evaluation and increasing the cache hit rate by allowing for inexact matches. A list of candidate queries stored in the cache that potentially could be used to answer a new query is first determined. This list may include all cached queries, cached queries containing exact matches for select list items, or cached queries containing exact and/or inexact matches. Each of at least one candidate query is then evaluated to determine whether or not there is a cache hit, which indicates that the candidate query could be used to answer the new query. The evaluation is performed using a set of rules that allows for inexact matches of aggregates, if any, in the new query. A query plan is generated for the new query based on a specific candidate query with a cache hit.

Abstract: Aspects of the invention relate generally to updating interconnected feature data stored in a repository while maintaining highly consistent views of the data. More specifically, aspects relate to updating some features in bulk while providing for incremental updates for others which are not completely independent of the bulk edits. Features which may be updated incrementally may contain references to other features and may be validated on an as-needed basis. These “incremental” features may also be associated with “backreferences,” which link two features together and are used in the validation process. For example, where feature A contains a link to feature B and feature B does not also include a link to feature A, if any edits are performed on feature B, a backreference may direct the server to determine whether the references in A are still consistent with the edits to B before the edit goes into a live state.

Abstract: For each data change occurring transaction created as part of a write operation initiated for one or more tables in a main-memory-based DBMS, a transaction log entry can be written to a private log buffer corresponding to the transaction. All transaction log entries in the private log buffer can be flushed to a global log buffer upon completion of the transaction to which the private log buffer corresponds.

Abstract: Multi-pass parallel merging in a database includes identifying characteristics of non-final pages during database query operations. A phase of page consolidation is triggered based on the identified characteristics and a final page is stored.

Abstract: An image processing apparatus including: an acquisition unit that acquires a first image, a second image, and an identifier indicating whether or not a portion corresponding to the first image and included in a third image is to be subjected to a second process; a first processing unit that (i) performs a first process on the first and second images acquired by the acquisition unit to generate the third image and (ii) performs conversion on a ? blend value of each pixel forming the generated third image for allocating the identifier to a portion of a possible range of the ? blend value; and a second processing unit that controls whether to perform the second process on each pixel forming the third image generated by the first processing unit, on the basis of the converted ? blend value.

Abstract: A CaQL API is provided by receiving a query directed to a catalog that includes metadata. A catalog access target is determined based at least in part on one or more of the following: a CaQL keyword which is included in the query, a name of a table in the catalog which is included in the query, or a predicate which is included in the query. A catalog function is generated based at least in part on the CaQL keyword and the catalog function is performed on the catalog access target.

Abstract: Various technologies described herein pertain to classifying data in a main memory database system. A record access log can include a sequence of record access observations logged over a time period from a beginning time to an end time. Each of the record access observations can include a respective record ID and read timestamp. The record access log can be scanned in reverse from the end time towards the beginning time. Further, access frequency estimate data for records corresponding to record IDs read from the record access log can be calculated. The access frequency estimate data can include respective upper bounds and respective lower bounds of access frequency estimates for each of the records. Moreover, the records can be classified based on the respective upper bounds and the respective lower bounds of the access frequency estimates, such that K records can be classified as being frequently accessed records.

Abstract: A real-time index system is provided for maintaining the consistency of an index of a database. The real-time index system can receive data associated with an inconsistency detected in the index, compute an index key value from the received data, and obtain the index record and data record associated with the computed index key value. The real-time index system can further compare the data in the data record with the corresponding data in the index record to identify a mismatch in data between the data in the index record and the data in the data record. The real-time index system can maintain the consistency of the index by modifying a portion of data in the index record to be consistent with a corresponding portion of data in the data record.

Abstract: The methods and systems for providing real-time business intelligence using search-based analytics engine facilitate a user to input a natural language query with regard to business analytics and obtain an analytics report in response without the user aggregating or processing raw data from a database query. Such business intelligence platform may receive a data analytics request including a user-desired data variable via a user interface; receive, via the user interface, user-configured parameters identifying a user-selected data source and a user-defined data set; form the user-defined data set based on user-configured parameters; query the user-defined data set to obtain a query result of the user-desired data variable; and generate a user interactive graphical representation of the query result of user-desired data variable.

Abstract: A search index stored within the system having a plurality of individual search index files having information stored therein. At least one of the individual search index files constitutes a term dictionary or a term index type file having internal structure that allows a portion of the individual search index file to be updated, encrypted, and/or decrypted without affecting the internal structure of the individual search index file. A file input/output (IO) layer encrypts the information being written into the individual search index file and to decrypt the information being read from the individual search index file. The file TO layer encrypts and decrypts only a portion of the individual search index file in reply to an operation without requiring decryption or encryption of the individual search index file in its entirety. A query interface executes the operation against the information stored in the memory in its decrypted form.

Abstract: Techniques for maintaining a global index in response to a partition being dropped are provided. In response to an instruction to drop a partition, partition identification data that identifies the partition is stored. Index entries, in the global index, that correspond to the dropped partition become “orphaned” entries. Later, an execution plan for a query is processed, where the execution plan targets a global index. During execution of the execution plan, one or more index entries are accessed. For each accessed index entry, the partition identification data is analyzed to determine if the index entry is an orphaned entry. If so, then the index entry is ignored for purposes of the query. Later, the global index may be updated to delete each orphaned entry. Such deletion may occur much later, such as during a time when the database is not queried or updated frequently.

Abstract: An information processing system in which a monitoring device can detect illegal and/or abnormal operations in a system to be monitored, without using detailed information of the system, is provided. In a target device 100, an operation data generation unit 130 generates operation data 140 as data of encoding a set of operations related to a predetermined program executed in an execution environment 120, and transmits the operation data to the monitoring device 200. In the monitoring device 200, an operation pattern storing unit 230 stores an operation pattern 240 as operation data related to a set of operations to be detected. An operation data decision unit 220 decides that the operation to be detected is executed in the execution unit when the operation data received from the target device 100 matches the operation pattern 240, and notifies of execution of the operation to be detected.

Abstract: A method for processing a dataset in a partitioned distributed storage system having data stored in a base table and an index stored in an index table, may include receiving base and index table metadata from the partitioned distributed storage system, where the base and index table metadata includes respective table partition information. The method may further include partitioning the dataset into a set of base-delta files according to the base table metadata, and generating a set of index-delta files corresponding with the base-delta files according to the index table metadata. The method may additionally include updating the partitioned distributed storage system with the set of base-delta and the set of index-delta files, where a first update of the base table is synchronous with a second update of the index table.

Abstract: Provided are techniques for using parallel inserts to insert into a column store. A list of sub-ranges for a columnar table is created. A change statement for one or more rows to be inserted into the columnar table is received. For each of the received change statements, a sub-range from the list of sub-ranges is identified and data is serially inserted into the identified sub-range of the columnar table, while allowing parallel processing of each change statement for different sub-ranges of the columnar table.

Abstract: Provided are techniques for using parallel inserts to insert into a column store. A list of sub-ranges for a columnar table is created. A change statement for one or more rows to be inserted into the columnar table is received. For each of the received change statements, a sub-range from the list of sub-ranges is identified and data is serially inserted into the identified sub-range of the columnar table, while allowing parallel processing of each change statement for different sub-ranges of the columnar table.

Abstract: A method for performing an application search. The method includes receiving a search query from a remote device and determining a consideration set of applications based on the search query. The consideration set indicates one or more applications corresponding to the search query. For each application indicated in the consideration set, the method includes determining whether the application is a potential spam application based on one or more developer features indicating features associated with a developer of the application. When the application is determined to be a potential spam application, the method includes applying a penalty to the application. The method further includes generating search results based on the consideration set and any penalties applied to the one or more application indicated in the consideration set and providing the search results. The search results indicate one or more of the applications indicated in the consideration set.

Abstract: A system and method is disclosed for scenario management. The system includes a database configured to store data describing a plurality of scenarios, each scenario comprising one or more fields and data describing the supply chain network comprising a plurality of network components, each network component configured to supply one or more items to satisfy demand. The system further includes a server coupled with the database; the server accesses the data describing the plurality of scenarios and accesses the data describing the supply chain network. The server further traverses the one or more fields of the plurality of scenarios until a value is determined and stores the determined value in the database for each of the one or more fields of the plurality of scenarios.

Abstract: Systems and methods are disclosed in which a self-describing file is generated and utilized to provide applications with the ability to properly preserve unknown file content. A self-describing file may contain, or be associated with, an extension section that provides information that an application can use to properly calculate unknown file content. The extension section may include functions of formulas that the application can use to calculate values for data that the application would not otherwise support. This allows for the content of the self-describing file to be modified by an application that does not support all of the capabilities of the file while maintaining the integrity of the file and user experience when the file is subsequently accessed by a full featured application.

Abstract: Disclosed herein are system, method, and computer program product embodiments for storing data in a database using a tiered index architecture, An embodiment operates by creating a first tier and assigning a first threshold size to the first tier. When the first tier exceed the first threshold size, the system pushes data from the first tier into a second tier.

Abstract: In general, embodiments of the present invention provide systems, methods and computer readable media for data record compression using graph-based techniques.

Abstract: In one aspect, a method includes validating application components, a set of operations and a flow of the operations. The application components, the operations and the flow of the operations are determined from a service plan. The flow of the operations enables protection and reuse of application components. The method also includes executing an operation of the set of operations, collecting status of the executing of the operation, determining dependent operations that are dependent on the operation, performing an affinity process based on a set of rules to determine which application components to group under a single dependent operation and which application components to separate into different dependent operations, and repeating the validating, executing, collecting, and determining for each dependent operation.

Abstract: A distributed storage system comprises a plurality of data storage nodes that store a plurality of object data items in a distributed manner. The plurality of object data items are respectively characterized by a data coordinate and identified by a data identifier. The plurality of data storage nodes are respectively assigned a node coordinate in a space identical to that of the data coordinate. After selecting as first data storage nodes from among the plurality of data storage nodes a plurality of data storage nodes each assigned a node coordinate having a relatively short distance from a data coordinate characterizing each of the plurality of object data items, any of the object data item is respectively stored in a data storage node determined based on a data identifier that identifies the object data item from among the plurality of first data storage nodes.

Abstract: A real-time messaging platform and method are disclosed which can be used to promote content in the messaging platform. In one embodiment, the promotion system is disclosed which performs initial candidate selection so as to narrow down the set of candidate promotions before applying more expensive processing. The candidate selection takes advantage of the connection graph information associated with accounts in the messaging platform to identify targeted accounts. In another embodiment, the promotion system uses a prediction model to predict a user's engagement with the promotion and utilizes the prediction to assist in ranking the candidate promotions. Promotions can be assigned metrics based, for example, on a weighted combination of user engagement rates, decayed with time to reflect an intuition that recent interactions by one or more users with the promotion will have a greater impact than older interactions with the promotion.

Abstract: In search that uses searchable code, the search query and the secure index is collated in round-robins fashion, registering the required secure index and a characteristic quantity of deposited data in a database server to realize the searchable code. The server uses the characteristic quantity to perform clustering on the secure index. For search, collation is first performed only for representative data of a cluster. For a hit, the collation priority is raised for all the data included in the cluster. When there is no hit, the priority is lowered. After calculating the priority, collation is performed sequentially for all the data on the basis of the priority.

Abstract: Managing a multi-version database is provided. A logical record identifier to physical record row identifier indirection mapping table on a solid-state storage device is extended to include a plurality of delta blocks. A delta block within the plurality of delta blocks is maintained for each primary key in a plurality of primary keys associated with a data table on a magnetic hard disk storage device.

Abstract: A method for refining a process model includes mining a process model from a set of execution traces; determining whether the process model is too dense or too sparse; learning a predictive model from the execution traces to predict an outcome; modifying the predictive model; and mining a refined process model from updated traces based on attributes present in the modified predictive model. Modifying the predictive model includes making the predictive model more specific if it is determined that the process model is too dense; and making the predictive model more general if it is determined that the process model is too sparse.

Abstract: User weighted data indicating acceptance of a given data extraction template and weighted data indicating the number of data fields that the data extraction template can extract accurately is used to calculate data extraction template ranking, or a weighted ranking score, to be associated with the data extraction template. Then the data extraction template having the highest data extraction template ranking score is used in a first attempt to extract data from a source documents of the source document type associated with the data extraction templates. As more data extraction templates associated with a given source document type are received, the data extraction templates having the lowest data extraction template ranking scores are detected/eliminated.

Abstract: User acceptance of a given data extraction template and the number of data fields that the data extraction template can extract accurately is used to calculate data extraction template ranking, or a ranking score, to be associated with the data extraction template. Then the data extraction template having the highest data extraction template ranking score is used in a first attempt to extract data from a source documents of the source document type associated with the data extraction templates. As more data extraction templates associated with a given source document type are received, data extraction template ranking scores are updated/modified, and, in one example, the data extraction templates having the lowest data extraction template ranking scores are detected/eliminated.

Abstract: A system and method for the matching addresses is provided. Addresses may be received from a search engine or other source for purposes of matching. Address parts in the addresses may be contextually identified. Identified address parts, including their associated data, that have address part types that are alike may be compared to one another and a contextual matching score may be calculated and assigned. A free format token analysis of the addresses may also be performed in parallel with, before, or after, the contextual identification, and a free format matching score may be calculated. An address likeness score may be calculated and assigned based on the contextual matching score and the free format matching score.

Abstract: A system and method are disclosed for locating, collecting, collating, analyzing, and reporting on summarized data that is generated from regulatory compliance matter data. Data is collected and compiled from multiple sources, including government databases, web pages, and regulatory documents. These collected data are consolidated and reconciled. A single topic record is created for a person, company, or product. Duplication and redundancy within the information are reduced. Corrections in data format are made for inconsistencies that exist between different information sources. Broad and/or narrow searches are enabled with the retrieval of information and/or relevant documents. The integrated data and associated analyses can be presented in reports that can be made accessible through a LAN, a WAN, a desktop, and/or a web interface.

Abstract: A high-speed credit-based allocator circuit receives an allocation request to make an allocation to one of a set of a processing entities. The allocator circuit maintains a chain of bubble sorting module circuits for the set, where each bubble sorting module circuit stores a resource value and an indication of a corresponding processing entity. A bubble sorting operation is performed so that the head of the chain tends to indicate the processing entity of the set that has the highest amount of the resource (credit) available. The allocation requested is made to the processing entity indicated by the head module circuit of the chain. The amount of the resource available to each processing entity is tracked by adjusting the resource values as allocations are made, and as allocated tasks are completed. The allocator circuit is configurable to maintain multiple chains, thereby supporting credit-based allocations to multiple sets of processing entities.

Abstract: Methods and systems for partitioning and dynamically merging a database index are described. A database index includes a single first-level index partition stored in a data cache. As the first-level index partition in the data cache reaches a predetermined size, it is copied to secondary storage and a new index partition is generated in the data cache. When the number of index partitions in secondary storage reaches some predetermined number, the index partitions are merged to create a single index partition of a higher level in a hierarchy of index partitions having an exponentially increasing size with each increase in level within the hierarchy.

Abstract: There are provided a system and a computer program product for operating multi-node data stores. The system stores a data table in a first computing node and stores an index table in a second computing node. The index table provides keys used for accessing data in the first computing node and other multi-node data stores. The system performs operations that update or read the data table accessed from the first computing node and the index table accessed from the second computing node. The operations optimize between latency in updating or reading the data table and the index table and data consistency maintained between data entries in the data table and data entries pointed by indices in the index table.

Abstract: There is provided a method for operating multi-node data stores. A data table is stored in a first computing node and an index table is stored in a second computing node. The index table provides keys used for accessing data in the first computing node and other multi-node data stores. Operations that update or read the data table accessed from the first computing node and the index table accessed from the second computing node are performed. The operations optimize between latency in updating or reading the data table and the index table and data consistency maintained between data entries in the data table and data entries pointed by indices in the index table.

Abstract: Methods, systems, and computer-storage media having computer-usable instructions embodied thereon for identifying related entities are provided. One or more entities may be identified from a search query. The one or more entities may include any identifiable term having related information associated therewith. An entity store may be referenced to identify one or more related entities related to the entity. The one or more related entities, along with their relationship(s) to the entity (and one another, perhaps) may then be ranked and displayed to a user.

Abstract: Methods and apparatuses are disclosed. Previously stored images of one or more geographic areas may be viewed by online users. A new low-resolution image may be acquired and aspects of the new low-resolution image may be compared with a corresponding one of the previously stored images to determine an amount of change. A determination may be made regarding whether to acquire a new high-resolution image based on the determined amount of change and a freshness score associated with the one of the previously stored images. In another embodiment, a new image may be captured and corresponding location data may be obtained. A corresponding previously stored image may be obtained and compared with the new image to determine an amount of change. The new image may be uploaded to a remote computing device based on the determined amount of change and a freshness score of the previously stored image.

Abstract: A data structure comprises a clump header table, an inline tree data structure, and one or more auxiliary data structures. Each clump header record includes an indicator of a location in the inline tree data structure of corresponding binary string segments. Clump header records or auxiliary header records include indicators of corresponding locations in the corresponding auxiliary data structure. Each auxiliary data structure can be altered without necessarily altering the inline tree or clump header table. A dedicated, specifically adapted conversion program generates the clump header file, the inline tree data structure, and the one or more auxiliary data structures. The data structure can be stored on any computer-readable medium, and can be read entirely into RAM to be searched (with or without filtering on one or more filter data fields). A dedicated, specifically adapted search and filter program is employed, which can list or enumerate the retrieved data records.

Abstract: A mechanism for providing messages for Java message service (JMS). A method includes receiving, by a Java message service (JMS) server executed by a processing device, key-value data pair. The key-value data pair is sent by a client. The method also includes extracting, by the processing device, destination information of a JMS message from the value data of the key-value data pair. The destination information is either a JMS queue or a JMS topic. The method further includes storing, by the processing device, the key-value data pair in a column family of not only structured query language (NoSQL) database when one of the JMS queue or the JMS topic associated with the received key-value data pair exists in the column family of the NoSQL database. The column family includes a plurality of stored key-value data pairs.