Abstract: Data archiving methods and data archiving apparatus are disclosed. An example method includes storing a first relational data structure generated in connection with a first iteration of an archiving process; determining a status of the first relational data structure; and when the status is valid, using the first relational data structure in a second iteration of the archiving process.

Abstract: Methods for resolving ambiguity in a search of a tree data structure are provided. Ambiguity occurs when a searched value occurs at two or more nodes of the tree data structure. Weighted distances between a context node and two or more candidate nodes are determined where each of the candidate nodes contains the searched value. The weighted distance between the context node and each candidate node equals the number of downward steps from the context node to the candidate node multiplied by a first constant plus the number of upward steps from the context node to the candidate node multiplied by a second constant. The node having a desired weighted distance is selected and information from the selected node is returned.

Abstract: A method of reducing the time taken to manufacture a bitemporal relational database is disclosed. The method involves designing business database tables with relational rules stored in a relational kernel or referential rule dictionary, and designing those tables so as to be without start date and end date columns for start of valid time and end of valid time for entities, and designing the system to be without history tables recording the history of relationships between entities in the database; the system being designed as a current view with primary key and unique key constraints, and time-related issues being taken care of by the S$, T$, and E$ tables automatically generated as the data structure of the system is populated with data.

Abstract: A data structure embodied on a computer-readable medium in conformance with a database schema for accessing and managing data related to a plurality of watchlists in a relational database system in a high demand environment, wherein the database schema comprising a watchlist table, a watchlist entry table for storing high-level information, and a plurality of detail tables for storing detailed information associated with a watchlist.

Abstract: Methods and systems for knowledge discovery and organization employ a relational meta model and domain context-based knowledge inference engine to produce answers to queries that involve inferences among items stored as knowledge in a knowledgebase.

Abstract: Extended associations are determined based on binary associations. The extended associations are associations among three or more terms in input data, and the binary associations are between terms in the input data.

Abstract: After receipt of an instruction (e.g. a database statement), one or more computers specialize an interpreter with the received instruction as constant, to obtain a specialized interpreter that is stored in memory and/or disk. The specialized interpreter is then invoked to execute the received instruction. Depending on the embodiment, the interpreter being specialized may additionally be received and used in binary form without specialization. Specifically, in some embodiments, an identical interpreter is received in two forms: in a binary language specific to the one or more computers and also in a language that is acceptable to a specializer, such as a source language or an intermediate language. The interpreter in the binary language is invoked by default unless a predetermined condition for specialization is met. When the predetermined condition is met, the interpreter in the specializer-acceptable language is specialized by the specializer, and then the specialized interpreter is invoked.

Abstract: A web site determination unit determines web sites associated with any one of a plurality of users of interest. A web site association unit associates, among the determined web sites, a plurality of the web sites with each other, each of the plurality of the web sites satisfying at least one of a condition on a feature amount of the each of the plurality of the web sites and a condition on at least one of the users of interest associated with the each of the plurality of the web sites. Accordingly, web site groups possibly having a commonality may be determined among web site groups associated with users of interest.

Abstract: Systems and methods for database usage visualization are disclosed. One disclosed embodiment is a method including the steps of receiving a virtual particle associated with an access event associated with a database; generating a first display signal configured to cause the display device to display the virtual particle within a virtual physical environment from a perspective point; transmitting the first display signal to the display device; determining an interaction between the virtual particle and a virtual physical object corresponding to a database object of a database within the virtual physical environment; changing a state of the virtual particle based at least in part on the interaction; generating a second display signal configured to cause the display device to display the virtual particle within the virtual physical environment from the perspective point based on the changed state of the virtual particle; and transmitting the second display signal to the display device.

Abstract: Information is organized according to context to manage large amounts of data with a useful result. Schema definitions and other structure-defining components can be defined by curators or individuals to organize information according to context, and permit presentation of the context in the form of a mapping. The map topology can also be defined by curators and individuals for forming a visual map of the context-oriented data. Such visual maps can embed applications that can use the context-oriented data as input to expand the usefulness of the context-organized data. A repository can store relationships between the contexts as established by the schema, as well as data and data structures related to linking applications or contexts in accordance with curation activity. The resulting visual map is searchable, filterable and browseable to permit useful data insights to be annunciated.

Abstract: A storage unit stores at least one attribute each assigned an attribute identifier uniquely identifying the attribute. Each attribute identifier is associated with at least one piece of equivalent reference data each representing the attribute. Each attribute identifier is not a word representing the attribute, and is made of a symbol having no meaning per se. A weight of association between an attribute identifier and each of at least one piece of equivalent reference data represents a degree of relatedness between the attribute and the piece of equivalent reference data. An operation unit determines whether or not given data is the same as a piece of equivalent reference data, obtains a weight of association between the piece of equivalent reference data determined to be the same and an attribute identifier, and selects the attribute when a sum of at least one weight obtained for the attribute satisfies a predetermined condition.

Abstract: A data integration system (100, 10-14) comprises a plurality of data sources (10-14) and a mapping system (120, 121, 122, 125, 126, 127, 128) for providing mapping between the data sources (10-14) and a global ontology. The global ontology comprises a plurality of elements including at least a plurality of concepts, at least some of which include one or more attributes. The data integration system further comprises a user interface (110). The user interface (110) is operable in use to provide an integrated, global view of the data contained in the data sources (10-14) and to permit a user to interact with the data sources (10-14) using the global ontology.

Abstract: A playlist can be generated based on a chart or list including ranked media items, e.g. songs, videos, etc., by automatically including the highest ranked media items to the playlist, but only adding some of the lower ranked media items to the playlist. A particular lower-ranked media item can be pseudo-randomly excluded from the playlist if that media item has a ranking in a current version of the chart that is lower than its ranking in a previous version. Once the desired number of media items has been added to an intermediate list, the intermediate list can be inverted, and station identifiers can be interspersed between the media items.

Abstract: According to an example implementation, a non-transitory computer-readable storage medium is provided that includes computer-readable instructions stored thereon that, when executed, are configured to cause a processor to at least: store a relationship definition including one or more selectors identifying events participating in the relationship and one or more constraints between the events, at least one of the constraints expressed in terms of one or more relationship parameters. The instructions further cause the processor to receive one or more events, evaluate the received events against the one or more selectors, create a candidate relationship when the relationship parameters have been defined based on receiving one or more events that match one or more of the selectors, and convert the candidate relationship to a relationship instance when a minimum number of events matching each of the selectors are received.

Abstract: A balance is provided between automation of repetitive database creation and configuration efforts, on the one hand, and flexibility to depart from prior configurations, on the other hand, to assist developers with aspects of database initialization. An application domain includes data context instances, database connections, object models mapped by an object-relational mapper, and database initializers. Upon the first attempted runtime use of a particular database connection—data context instance—object model combination, a database initializer is invoked. Initializers may check to see if the database exists, (re)generate a database and schema based on the object model, determine whether the database is compatible with the current object model, delete the database and its schema, seed data, modify database indexes, and/or migrate an existing database, for example. A custom initializer can run developer-supplied code as desired to place the database in a known state for use by the application.

Abstract: Methods and comment association systems for associating one or more comments with one or more primary electronic documents are described. In one aspect, the method comprises: identifying, at a comment association system, one or more key terms from at least a portion of the one or more primary electronic documents; identifying, at the comment association system, one or more comments associated with the identified key terms; determining, at the comment association system, whether an identified comment is sufficiently related to the one or more primary electronic documents by calculating one or more relation score for that identified comment and comparing the relation score to one or more threshold; and if the identified comment is sufficiently related to the one or more primary electronic documents, then associating the identified comment with the one or more primary electronic documents at the comment association system.

Abstract: A search extent setting unit that identify a layer made to correspond to an asset specified by referencing a first database for recording assets made to correspond to each of users by relating each of the assets to a first layer that is a layer related to a virtual system individually used by each of the users, or to a second layer that is a layer related to hardware and software, and to set an extent for extracting information about other assets having a relationship with the specified asset according to a layer of the specified asset, and an extracting unit that extract other assets that have a relationship with the specified asset and are present in the extent set by referencing the first database and a second database for recording information indicating a relationship among the assets, and the first database based on the first asset.

Abstract: In general, this disclosure is directed to a software virtual machine that provides high-performance transactional data acceleration optimized for multi-core computing platforms. The virtual machine utilizes an underlying parallelization engine that seeks to maximize the efficiencies of multi-core computing platforms to provide a highly scalable, high performance (lowest latency), virtual machine. In some embodiments, the virtual machine may be viewed as an in-memory virtual machine with an ability in its operational state to self organize and self seek, in real time, available memory work boundaries to automatically optimize maximum available throughput for data processing acceleration and content delivery of massive amounts of data.

Abstract: A data validation service includes providing a user interface to a subscriber of the service via a computer device of the subscriber, receiving a data validation rule specified by the subscriber and an address of a database subject to the data validation, and generating a configuration file that includes the address of the database. The service also includes transmitting the configuration file and a thin client application to the computer device over a network, the thin client application configured to read the configuration file and pull data from the database. The service further includes receiving the data from the computer device via the network, performing the data validation by executing the data validation rule with respect to the data, and compiling results of the data validation and providing the results to the computer device.

Abstract: Systems and methods for replication replay in a relational database are disclosed. In one embodiment, a relational database includes a master database and a slave database, and events performed on the master database are stored in a log. A portion of the log is provided to a slave replay system associated with the slave database, and the slave replay system identifies a first table row associated with a first event of the portion of the log and a second table row associated with a second event in the portion of the log. The slave replay system replays the first and second events on the slave database in parallel if the first and second rows are different rows with unique sets of values, and otherwise replays the first and second events serially.

Abstract: A security mechanism in a database management system enforces processing restrictions stored as metadata to control how different pieces of a multi-nodal application are allowed to access database data to provide data security. The security mechanism preferably checks the data security restrictions for security violations when an execution unit attempts to access the data to insure the nodal conditions are appropriate for access. When the security mechanism determines there is a security violation by a query from an execution unit based on the security restrictions, the security mechanism may send, delay or retry to maintain data security. Nodal conditions herein include time restrictions and relationships with other columns, rows or pieces of information. For example, multiple processing units may be allowed to execute together, but the security mechanism would prohibit these processing units to access specific pieces of information at the same time through the use of metadata in the database.

Abstract: Systems, methods and computer program product embodiments for auto-correction in database replication are disclosed herein. An embodiment includes receiving a log record of one or more database row changes on a table marked for replication. From the received log record, one or more insert operations on the marked table are identified. Each identified insert operation is automatically replaced with a first pair of operations, where each first pair comprises a delete operation associated with a new insert operation. Each first pair, when executed at a replicate database, acts to delete data at a first location identified by each identified insert operation prior to inserting data of the new insert operation at the first location.

Abstract: Systems and methods for redistributing data in a relational database are disclosed. In one embodiment, the database includes a plurality of rows of data distributed across a plurality of slices of a table in the database. The database system is configured to distribute the rows of data across the slices according to a first function based on one or more columns of the database. The database system monitors at least one database statistic indicative of variation in a distribution of the rows of data across the slices and detects a redistribution condition based on the at least one monitored database statistic. The database system is further configured to respond to the detected redistribution condition by redistributing the rows of data across the slices according to a second function based on a different number of columns than the first function.

Abstract: Disclosed is an approach for presenting RDF data as a set of relational views. By presenting the RDF data as relational views, this permits integrated access to the RDF-based data from relational tools.

Abstract: A general model is provided which provides collective factorization on related matrices, for multi-type relational data clustering. The model is applicable to relational data with various structures. Under this model, a spectral relational clustering algorithm is provided to cluster multiple types of interrelated data objects simultaneously. The algorithm iteratively embeds each type of data objects into low dimensional spaces and benefits from the interactions among the hidden structures of different types of data objects.

Abstract: Systems, methods and computer program products for facilitating the collection of data within a computer network (especially an intranet) while complying with applicable privacy laws and regulations, as well as individual organizations' rules addressing intranet users' privacy are disclosed. Such systems, methods and computer program products allow for the collecting of activity information related to computer-based activities performed by users while logged into an organization's intranet. Such activity includes navigating to URLs, opening and editing documents, writing, opening and reading email and instant messages, and the like. The collecting, consolidating, storing and exposing of such activity information—while ensuring privacy requirements—serves as a basis for high-value services (e.g., augmenting documents with extra information, improving search results, automatic news feeds, social networking announcements, etc.) to be offered and provisioned to such users.

Abstract: Methods and systems are provided for storing, organizing, accessing, and communicating using image-based documents. A computer-implemented method for online communication using business cards includes receiving a business card in image format, conducting an optical character recognition (OCR) conversion process to produce an equivalent business card in text format, identifying keywords of the equivalent business card in text format, linking the keywords with the business card in image format and the corresponding equivalent business card in text format, attaching user-provided privacy setting of permissions of accessibility to the business card, attaching user-provided contents to the business card, and providing information of the business card and its associated contents online to one or more users according to the user-provided privacy setting of permissions of accessibility to the business card.

Abstract: A sender selection is detected at a sender computer system within a user interface of at least one suggested folder name for a composed electronic message for a recipient receiving the electronic message to select as a folder name for filing the electronic message. The at least one suggested folder name is attached to the electronic message at the sender computer system for distribution to the recipient. The electronic message is sent with the suggested filing folder name from the sender computer system to a recipient, wherein a recipient receiving the electronic message receives the at least one suggested folder name specified by the sender in the electronic message for selecting a folder for filing the electronic message in a messaging filing directory for the recipient.

Abstract: A receipt receives an electronic message from a sender, wherein said electronic message comprises at least one suggested folder name specified by the sender for the recipient to select as a folder name for filing the electronic message, wherein the at least one suggested folder name is detected by a sender computer system from a selection by the sender within a user interface of the sender computer system of the at least one suggested folder name for the electronic message and inserted into the electronic message. The electronic message is filtered to detect the at least one suggested folder name for filing the electronic message in a messaging filing directory. Responsive to the recipient selecting to file the electronic message, the electronic message is filed in at least one folder with the suggested folder name from among a plurality of folders.

Abstract: An electronic management system accessible over the internet manages the elements of a user's large-scale writing project. The user enters or otherwise uploads project data including main document data and research data and the system organizes the data according to the needs of the writer, preferably using a hierarchy that conforms to the logical progression of the written work. The system manages referential linkages between the different types of data in order to maintain consistency across stored data when it is updated. The system may compile or consolidate data and generate reports that the writer uses while proceeding through the project, including calculations relating to the type, age, and number of references cited in the project. The system may interface with other software programs, such as word processors, data processors, and online libraries, to export or import data related to the project.

Abstract: The invention relates to predicting or determining risk of a hematopoietic cell transplant (HCT) from a donor to induce Graft vs. Host Disease (GVHD) in a HCT recipient; to classifying HCT from a candidate donor according to the risk of inducing GVHD in a HCT recipient; and to organizational constructs (e.g., databases) and methods of producing organizational constructs (e.g., databases) in which HCT of one or more candidate donors is classified or scored according to risk of inducing GVHD in a HCT recipient. The invention also relates to kits and arrays useful for predicting or determining risk of HCT from a candidate donor to induce GVHD in a HCT recipient, and for classifying or scoring such donors according to risk of inducing GVHD in a HCT recipient.

Abstract: The disclosed embodiments provide a system that facilitates the maintenance and execution of a software offering. During operation, the system obtains model data associated with a multidimensional model of the software offering. Next, the system stores the model data in a graph database. Finally, the system uses the graph database to facilitate management of the software offering.

Abstract: Aspects of the subject matter described herein relate to incrementally modifying schemas and mappings. In aspects, an indication of a change to a client schema is received and a compilation directive is received. The compilation directive may indicate how one or more entities or associations in the client schema are to be mapped to the store schema. In response to receiving the indication of the change and the compilation directive, mapping data and storage schema may be incrementally modified with incremental revalidation and incremental updating of query and update views.

Abstract: An in-memory computing system for conducting on-line transaction processing and on-line analytical processing includes system tables in main memory to store runtime information. A statistics server can access the runtime information to collect monitoring data and generate historical data and other system performance metrics.

Abstract: A computer system automatically evaluates the performance of a content generator using content created by the content generator and user and content generator interactions with the content. Specifically, the system analyzes data regarding the content, e.g., a peer-review quality score, and analyzes data regarding user and/or content generator interactions with the content, e.g., website comments regarding the content. In addition, the system considers user and content generator interactions with the content on third-party websites, e.g., the number of Facebook® “likes” or other social media actions. The system applies rules to assign values to various data points (e.g., a value of 0.3 may be assigned for each Facebook® “like” by a user). The rules may also define weighing components to incentivize particular actions. Weighed values are summed to evaluate each content generator. The scores for each content generator may be compared to create a content generator ranking.

Abstract: A system and method for targeted event detection and notification based on combinations of time, location and context. A database stores information about users of the system including profile information, and information about real world events such as date, time, and event information. Events are tagged with information that allows searching. A suggestion engine matches particular events to particular users. Events are private (individually), private to groups, and public. A third party such as merchant or advertiser can generate and publish events to users who possess specified profiles. User information is de-identified to address privacy concerns. Users are provided with notifications of events or offers that meet their interest profiles and may accept such events or offers to their calendars, reminder list, timeline or otherwise.

Abstract: A system and method of providing a window sorting mechanism comprises receiving an array having a plurality of objects, wherein each object contains a digit. The digits in the received array are unsorted in association with a desired sorting arrangement. A length of the received array is determined, whereby received array is separated into a plurality of sub-arrays based on the length of the received array. An inter sub-array digit sorting process is performed in a first iteration between a first sub-array and a second sub-array to sort digits in correspondingly positioned objects in accordance with a first comparison rule. A first adjacent-object digit sorting process is performed in a second iteration on the first and second sub-arrays using simultaneously sorting windows of a first digit size in accordance with a second comparison rule. A second adjacent-object digit sorting process is then performed in a third iteration on the first and second sub-arrays using sorting windows of a second digit size.

Abstract: The present invention provides a method of transferring content from a file and a database. In this case, the file includes content instances, each content instance being associated with a respective field, and each field having a respective type. The transfer is achieved by determining the type of each field, and then storing each content instance in a store in accordance with the determined field type of the associated field. Each content instance can then be transferred to the database in accordance with the determined field type. A similar procedure is provided for creating XML files based on content within the database.

Abstract: Disclosed are methods and systems to provide for using database triggers to maintain a relational persistence of the transitive closure and path structure of an object hierarchy in the form of an object hierarchy bridge table. In one embodiment, database triggers fire when objects or relationships are added or deleted from the hierarchy. Based on the additions and deletions, a delta can be calculated and applied to an object hierarchy bridge table and the graph transitive closure and path structure can be dynamically built and maintained as corresponding changes to the graph occur. Later, more efficient access and retrieval of a graph transitive closure and path structure can be retrieved without necessarily having to perform recursion to calculate the graph transitive closure and path at request time.

Abstract: The present invention provides a method of transferring content from a file and a database. In this case, the file includes content instances, each content instance being associated with a respective field, and each field having a respective type. The transfer is achieved by determining the type of each field, and then storing each content instance in a store in accordance with the determined field type of the associated field. Each content instance can then be transferred to the database in accordance with the determined field type. A similar procedure is provided for creating XML files based on content within the database.

Abstract: In a digital camera, a GPS receiver acquires latitude-longitude data, and the data are stored in a storage block while being added to data pertaining to a photographed image. When the thus-acquired latitude-longitude data show a neighborhood of a previously-registered home, an image processing block converts the latitude-longitude data into null data and stores the image data into the storage block while adding text data “Home” to the null data. When the acquired latitude-longitude data do not show any neighborhood of the home, the data are saved in the storage block while accuracy of the data is maintained.

Abstract: Systems, methods, and computer readable media for automatically generating Data Definition Language (DDL) commands from database log information is described. In general, techniques are disclosed for analyzing database log entries to identify those associated with targeted DDL commands and associating those entries with a DDL command object. The DDL command object may be used (immediately or at some later time) to generate a DDL commands corresponding to the (possibly many) aggregated log records associated with the command object. The use of multiple database log entries as described herein enables the generation of DDL commands that capture database activity occurring over a period of time (full time context auditing) and can, therefore, naturally account for database schema changes.

Abstract: A system includes a sensor and a processor. The sensor is configured to passively read data in packets as the packets are in motion on a network. The processor is cooperatively operable with the sensor The processor is configured to receive the read data from the sensor; and originate real-time map profiles of files and file data, both from the read data from the sensor, as the passively read packets are in motion on the network.

Abstract: Concepts and technologies are described herein for exposing and using metadata and for exposing meta-metadata in a tabularized format. Metadata associated with one or more ERP services is collected, parsed, and loaded into one or more sets of tables. The tables of metadata are exposed to software and/or devices to provide various functionality. The tables of metadata and meta-metadata data exposed in tabularized format are used at runtime, design time and/or at other times, and are used to provide various functionality. The tables of metadata and meta-metadata also are used to identify and track modifications made to one or more application objects associated with the ERP services, and to apply the modifications to new versions of metadata associated with the application objects.

Abstract: Representing structured data extracted from unstructured data in fashion allowing querying using relational database concepts. A method includes receiving user input specifying one or more database views. The method further includes receiving user input specifying an information extraction technique, such as an extraction workflow. The method further includes receiving user input specifying a corpus of data. The extraction technique is applied to the corpus of data to produce the one or more database views. These views can then be queried or operated on using database tools.

Abstract: Embodiments of the invention relate to organizing data records in a relational database. An aspect of the invention includes creating index items for a plurality of data records. Each index item includes a counter and the creating results in a plurality of counters. The numerical values of counters in corresponding index items are updated for data records in the plurality of data records that are subjected to random access. The plurality of data records are reorganized based upon the numerical values of the plurality of counters.

Abstract: Embodiments relate to systems and methods for generating portable interpolated data using object-based encoding of interpolation results. A database can store sets of operational data, such as financial, medical, climate or other information. For given data, a portion of the input data can be known or predetermined, while for a second portion can be unknown and subject to interpolation. The interpolation engine can generate a conformal interpolation function and interpolated input sets that map to a set of target output data. In aspects, the interpolation engine can interact with an object encoder module to access, extract, and encode the interpolated inputs and/or other data in an object-based format or schema, such as the extensible markup language (XML). The object encoder can generate an object-oriented interpolated data container to transmit to a local or remote database, and expose that container to sets of applications for access and use by those applications.

Abstract: Embodiments relate to systems and methods for generating interpolated data sets converging to optimized results using iterative overlapping inputs. A database can store sets of operational data, such as financial, medical, climate or other information. For given data, a portion of the input data can be known or predetermined, while for a second portion can be unknown and subject to interpolation. The interpolation engine can generate a conformal interpolation function and interpolated input sets that map to a set of target output data. In aspects, to attempt to drive the set of interpolated input data and/or other results to an optimized and/or steady-state value or values, the interpolation engine can generate a set of shifts or alterations to the set of combined input data as that data exists, to create a set of iterative overlapping input data.

Abstract: An electronic book system allows third parties to make available to users extensions, or “add-ons”, that provide additional features and functions relating to a book. Add-ons are launched in a manner that takes into account the reader's context, such as a current page the reader is looking at. Payment mechanisms as well as policies for the add-ons are integrated so that restrictions imposed by both book publishers and add-on publishers are respected.

Abstract: A system and method for quantifying the working capital benefit of pooling a number of separate cash accounts. The average (mean) cash balance of the pooled account is determined to be the sum of the means of each of the individual accounts. Similarly, the standard deviation of the pooled account is determined to be the square root of the sum of the squares of the standard deviations of the individual accounts. Accordingly, the minimum cash level of the pooled account is 2.3 times the square root of the sum of the squares of the standard deviations of the individual accounts. In order to determine the benefit of pooling, the present invention determines the difference between the minimum aggregate cash required by the separate companies and the minimum cash required in the pooled account. If pooling is to be beneficial, from a working capital perspective, the minimum cash required in the pooled account will be significantly less than the aggregate cash required by the separate companies.