Abstract: One aspect relates to generating a unifying virtual schema in a non-relational database. A database is analyzed either in its entirety, or in part by using a sample of the database as a representative portion of the database as a whole. Common attributes within the database may be identified, ranked and displayed to a user through one or more of various visualizations. In other examples, the user may further refine the way the data is displayed and how much is displayed by interacting with a user interface.

Abstract: One aspect relates to generating a unifying virtual schema in a non-relational database. A database is analyzed either in its entirety, or in part by using a sample of the database as a representative portion of the database as a whole. Common attributes within the database may be identified, ranked and displayed to a user through one or more of various visualizations. In other examples, the user may further refine the way the data is displayed and how much is displayed by interacting with a user interface.

Abstract: An apparatus and method for web page access and an apparatus and method for structuring a web page access history are provided. The apparatus for structuring a web page access history includes a topic extractor configured to analyze a web page accessed by a user to extract at least one topic related to the page, a mapper configured to map the at least one extracted topic onto a node of an ontology-based data structure, and a summary graph generator configured to extract a sub graph including the mapped node from the data structure, and to generate a summary graph based on the extracted sub graph.

Abstract: Systems and methods for cross device and/or cross operating system task continuity between devices for frictionless task engagement and reengagement. Task continuity can provide for simple detection and selection of recently viewed and/or modified tasks. Task continuity can provide for simple engagement of new tasks in applications and/or websites, the new tasks being related to recently presented and/or modified tasks. Responsive to selection of the recently presented and/or modified task, the task can be seamlessly reengaged from the point at which it was last presented and/or modified. Responsive to selection of a new task, the task can be engaged from a starting point. Upon completion of the task on one device, the task can be closed across devices. Task continuity can be enabled on a single device or across a plurality of devices. Task continuity can be enabled on a single operating system, or across a plurality of operating systems.

Abstract: In a data visualization system, a method of analysing and representing spatial data sets to optimize the arrangement of spatial elements, the method including the steps of: retrieving data from a data storage module that is in communication with the data visualization system, determining lift values for a plurality of predefined spatial areas from the retrieved data based on a set of fuzzy association rules applied to the predefined spatial areas, determining spatial performance values for the predefined spatial areas, and calculating a weighted spatial relationship between the determined lift values and spatial performance values.

Abstract: A computer displays a graphical user interface on its display. The graphical user interface includes a schema information region and a data visualization region. The schema information region includes multiple operand names, each operand corresponding to one or more fields of a multi-dimensional database that includes at least one data hierarchy. The data visualization region includes a columns shelf and a rows shelf. The computer detects user actions to associate one or more first operands with the columns shelf and to associate one or more second operands with the rows shelf. The computer generates a visual table in the data visualization region in accordance with the user actions. The visual table includes one or more panes. Each pane has an x-axis defined based on data for the one or more first operands, and each pane has a y-axis defined based on data for the one or more second operands.

Abstract: Improved method of and apparatus for aggregating data elements in multidimensional databases (MDDB). In the preferred embodiment, the apparatus is realized in the form of a high-performance stand-alone (i.e. external) aggregation server which can be plugged-into conventional MOLAP systems to achieve significant improvements in system performance. In accordance with the principles of the present invention, the stand-alone aggregation server contains a scalable MDDB and a high-performance aggregation engine that are integrated into the modular architecture of the aggregation server. The stand-alone aggregation server of the present invention can uniformly distribute data elements among a plurality of processors, for balanced loading and processing, and therefore is highly scalable.

Abstract: A method and system for predicting future trends of terms taxonomies of users generated content. The method comprises crawling one or more sources of users generated content to collect phrases mentioned by users of the one or more data sources; periodically analyzing one or more term taxonomies to determine at least a trend of at least a non-sentiment phrase with respect of a plurality of sentiment phrases, wherein a term taxonomy is an association between a non-sentiment phrase and a sentiment phrase, the non-sentiment and sentiment phrases are included in the collected phrases; and generating a prediction of future behavior of the at least trend with respect of the one or more term taxonomies.

Abstract: In embodiments of the present invention, improved capabilities are described for perturbing non-unique values may comprise finding the non-unique values in a data table, perturbing the non-unique values to render unique values, and using the non-unique values as an identifier for a data item.

Abstract: Systems and methods that create and edit a network of interconnected concepts are disclosed. In one embodiment, a semantic engine implements a method comprising receiving a primary term representing a first concept to be added to a network of interrelated concepts, receiving at least one related term related to the primary term, receiving at least one relationship between the first concept and a second concept, receiving a strength value associated with the relationship, and adding the first concept to the network.

Abstract: Described is a technology in which a set of objects represent educational entities of an educational model, with relationships between objects. For example, a course object instance may have a relationship with a task instance and a user instance (such as representing a student). Other objects may include user credentials objects, group objects, degree program objects, course plan objects, institution objects, school objects, and/or department objects. The set of objects may be pre-defined and maintained in a persistent storage; this pre-defined set may be extended with an extended object that has relationships with pre-defined objects. The educational entities of an object model may be maintained in rows of a table, with each row having a field that identifies which entity is represented by that row. The table is accessed to determine relationships between an instantiated object for an entity and at least one other instantiated object for another entity.

Abstract: Techniques for undropping objects (e.g., tables) and dependent objects in a database systems are provided. When an object is dropped, the object is moved to a recycle bin where it resides until the user undrops the objects or the object is purged. Dependent objects are also moved into the recycle bin with the object to which they depend. The object can be purged from the recycle bin explicitly by a user or when more storage space is needed. Purging of dependent objects and partitions can be deferred if not required to obtain more storage space.

Abstract: In embodiments of the present invention, improved capabilities are described for perturbing non-unique values may comprise finding the non-unique values in a data table, perturbing the non-unique values to render unique values, and using the non-unique values as an identifier for a data item.

Abstract: Methods, systems, and computer program products are provided for processing correlated queries in a collaborative, role-based, peer-to-peer (P2P) execution system. A correlated query is configured in accordance to a collaborative correlated query process (CQP) template. The collaborative CQP template defines roles and steps, each step being executable by one of the roles. A role is assigned to each peer node of the P2P system. A peer node having a designated role executes a step that is executable by the designated role. A message is communicated to other P2P nodes to indicate completion of the step. Another peer node having a matching role to a next step in the correlated query executes the next step in response to the message.

Abstract: Automated comparison of Darwin Information Typing Architecture (DITA) documents for revision mark-up includes reading document data from first and second DITA documents into respective document object model trees of nodes, and identifying and collapsing emphasis subtree nodes in the trees into their parent nodes, the collapsing caching emphasis data from the identified subtree nodes. A preorder traversal transforms the model trees into respective pre-order node lists and captures adjacent sibling emphasis subtree nodes as single text nodes. The node lists are merged into a merged node list via a longest common subsequence process that recognizes matches node pairs having primary sort key information and document structure metadata meeting a match threshold, with differences between matching tokens of the node pairs saved. A merged document object model built from the refined merged node list is transformed into a hypertext mark-up language document.

Abstract: An extensible file system format for portable storage media is provided. The extensible file system format includes the specification of primary and secondary directory entry types that may be custom defined. The primary and secondary directory entry types can be further classified as critical and benign directory entries. The directory entry types can define whether a cluster chain corresponding to a file can be contiguously allocated.

Abstract: The present invention relates to methods, systems and apparatus for capturing, integrating, organizing, navigating and querying large-scale data from high-throughput biological and chemical assay platforms. It provides a highly efficient meta-analysis infrastructure for performing research queries across a large number of studies and experiments from different biological and chemical assays, data types and organisms, as well as systems to build and add to such an infrastructure. In particular, aspects of the invention relate to integrating, organizing, navigating and querying “directional” data, such as gene expression profiles.

Abstract: Methods, systems, and products for managing memory. In one general embodiment, the method includes assigning an isolated virtual heap in a global kernel heap of a global operating system environment to each of a plurality of isolated virtual operating system environments operating in a global operating system environment; and in response to an invocation of kernel heap memory allocation from one of the isolated virtual operating system environments, dynamically allocating memory to the invoking isolated virtual operating system environment from the virtual kernel heap assigned to the invoking isolated virtual operating system environment. The method may also include running the plurality of isolated virtual operating system environments in the global operating system environment. The plurality of isolated virtual operating system environments may share a single common kernel. The isolated virtual operating system environments may run under the same operating system image.

Abstract: Methods for processing streaming data records are provided that include facilities for defining and naming multiple input and output data streams using relational processing definitions and abstractions similar to those found in relational database management systems (RDBMS) and embodied as a set of communicating stream processing nodes. The result is a Distributed Data Stream Management System (DDSMS) which is also a kind of Relational Data Stream Management System (RDSMS). The former comprises a set of Relational Data Stream Management System (RDSMS) nodes, whereas the latter might contain only a single RDSMS node.

Abstract: A tagged content inference system and method is provided. The system facilitates browsing of content with a pseudo-hierarchical feel using algorithmically-deduced relationships between items based on user applied tags. Based, at least in part, upon tagged content, an inference component can infer relationships between items (e.g., creating a pseudo-hierarchy) in order to facilitate browsing of the items. The system can further include a relationship display component that can provide a visual representation of tagged items based on relationship(s) inferred by the inference component. The visual representation can further be based, at least in part, upon user input (e.g., threshold quantity of tags to be displayed, threshold strength of relationship, color setting(s), etc.).

Abstract: A system for detecting a local phenomenon, the system includes an interface for receiving queries information from a system for retrieving art related media, and a processor, configured to: (a) create a first local popularity chart, wherein the creating of the first local popularity chart includes enumerating, for each geographic area of a group of sampled geographic areas, identical query strings of queries that are included in a group of queries; (b) create a first global popularity chart, wherein the creating of the first global popularity chart includes enumerating identical query strings of the queries that are included in the group of queries; and (c) select at least one query string in response to a scoring of the query string at the first local popularity chart and to a scoring of the query string at the first global popularity chart; wherein the group of queries includes queries which were queried during a first period of time.

Abstract: A many-to-many relationship management system. In an object persistence management system, a many-to-many relationship manager can include one or more related objects; a junction table storing relationships between the related objects; and, one or more corresponding links. Each link can correspond to one of the objects. Furthermore, each link can persist state information for the corresponding object in an associated object table. Finally, each link can manage the junction table responsive to changing relationships with others of the related objects. Importantly, as the present invention distributes the management of the junction table, a counter-operation management protocol can be provided which can resolve conflicts which arise in the management of the junction table in response to changing relationships among their associated objects.

Abstract: A mechanism works in conjunction with a DB2® Log and an analysis tool, such as BMC's Log Master™, to handle logged data for Large Objects (LOBs) stored in tables of a DB2 database system. A plurality of controls track data logged for the LOBs. The mechanism reads log records from a DB2 Log and uses the controls to determine which of the tracked LOBs is associated with the log records and obtains data from those associated log records. The mechanism builds keys to index the data and stores the keys and the data in a Virtual Storage Access Method store having Key Sequenced Data Sets maintained separate from the log record store for the DB2 Log. When requested by the analysis tool, the data in the store can be reassembled using the keys and map records in the first store that map the logged data for the tracked LOBs.

Abstract: Methods, apparatuses, computer program products, devices and systems are described that accepting an input identifying a treatment target in search of an agent, the input associated with at least one query parameter; determining, based on the input, at least one subset of study data for which at least one adverse event profile associated with administration of at least one agent is acceptable within a defined limit relative to a population for which the at least one adverse event profile is unacceptable with respect to the defined limit; and presenting the agent, based on the at least one subset and the at least one query parameter.

Abstract: A statement is provided having a clause that can specify an aggregate function that is performed on a set of data. The statement may alter the data in the data set by deleting or updating the data. The clause may be a returning clause that accepts one or more aggregate functions for its arguments, operates on the set of data, and returns the result of the aggregate function without returning the entire set of data. Alternatively, a statement is provided for changing multiple sets of data without the need to place the multiple sets in a single array.

Abstract: The efficiency and versatility for the implementation of formulas in an on-demand database is improved. Formulas are categorized. Based at least partly on the categorization, formulas are evaluated synchronously or asynchronously. An asynchronous evaluation may be performed if a certain set of criteria is not satisfied. Asynchronous evaluations may be performed using a queue. During an asynchronous update of an object, a counter field and/or an estimate field may be used respectively for indicating the consistency of values of the object and a time when the values were consistent. The versatility of formulas is enhanced by using a formula to create a default value for a custom field when it is created and to determine whether an action is to be performed, and is enhanced by having an action define when a formula is to be updated.

Abstract: The present invention provides a method and device for creating a relation-type form database, the method comprising: displaying an existing form as a background image on a screen; drawing frames on predetermined positions of the background image with an operation means to create multiple data areas; and creating parallel relations and/or cross relations among the multiple data areas to form a relation-type database of the existing form. The operations of the present invention are easy and low-cost, which enable widely spreading of the application of databases.

Abstract: A method includes characterizing portions of a model as being either critical to a real-time execution of the model or non-critical to a real-time execution of the model, and generating code that is capable of real-time execution based on the critical portions of the model while maintaining the full functionality of the non-real-time critical sections, e.g., graphics, logging, other offline calculations, via a communication link and parallel host processing.

Abstract: A method and apparatus for agent-less auditing of a server, wherein the apparatus processes data for auditing a server. One or more portions of audit information (e.g., transaction log, trace log, or both) are coupled from a target server to an information server. The one or more portions of the audit information are processed at the information server to create audit data. The audit data is stored in an audit data repository.

Abstract: A method and structure for storing information for one or more semantic objects derived from raw data. A semantic object extracted from the raw data and classified to comprise the semantic object is received, the received semantic object having one or more attributes. A summary of attributes of the semantic object by calculating one or more statistics of one or more of the one or more attributes of the received semantic object, a confidence level of the received semantic object that quantifies a degree of certainty that the received semantic object has been correctly classified and/or labeled; and a compact representation of raw data of the received semantic object are generated. Indexing information for one or more of the summary of attributes and the compact representation of the semantic object is generated.

Abstract: Grouping media files via playlists on a computer-readable medium. One or more media files are selected according to a grouping criterion to define one or more playlists from the media files. A folder is associated with the playlists and stores values identifying each of the playlists associated with the folder along with references to each of the playlists.

Abstract: A resources sharing container having logic-linking mechanism for logically linking program code to pages, pages to applications and applications to solutions. The resources sharing container will have the ability to create finished solutions by using its logic functionalities (logic-linking, resources code, enhancements, etc.), application requirements (application pages and their programming code logic) and preconfigured enhancements (settings, translations, interfacing, securities, etc.), and have the final solution tailored to each user's prerequisites. Moreover, it will permit the creation of a global resource sharing of logically linked software code blocks, application pages and application page's settings that can be shared in house, over a network or globally over the Internet, thus, reducing replication and distribution costs, since all the developments, securities and enhancements are at the resources level at a single location.

Abstract: A method and system for contract processing. Sent by a procurement contract management system (PCMS) to decentralized execution systems is a list of I identifiers identifying a contract dataset in the PCMS earmarked for archiving. The PCMS receives from each DES a return list of M of the I identifiers approved by each DES for archiving. A generated intersection list includes a logical intersection of the return lists received from the decentralized execution systems. If the intersection list is not empty, the PCMS archives each contract dataset identified in the list of I identifiers and appearing in the intersection list and communicates to each DES that the archiving was performed by the PCMS for the contract datasets appearing in the intersection list. If the intersection list is empty, the PCMS communicates to each DES that the archiving will not be performed.

Abstract: A computer-based method and apparatus for identifying hazardous materials based on observable physical properties and signs and systems of exposure to the hazardous materials. The observable physical properties are obtained by preprocessing plain language data to obtain normalized descriptors and modifiers pertaining to a plurality of properties and signs and symptoms. The normalized descriptors and signs and symptoms are presented to a user in lists for comparison with a sample in the field. Once a material is identified, information can be obtained from the apparatus which is necessary for response to an incident involving the hazardous material. The preferred embodiments of the invention are particularly useful to responders to a hazardous waste incident.

Abstract: A multitier topology map describes a multitier compute infrastructure. The multitier topology map identifies components from at least two different tiers of the multitier compute infrastructure and indicates relationships between components including at least one cross-tier relationship between components. An interface module accesses the multitier topology map.

Abstract: Systems, methodologies, media, and other embodiments associated with supporting reference partitioned tables in a relational database are described. One example method includes identifying a partitioning strategy (e.g., range, list, hash) associated with a parent table that is related to a child table by a referential constraint. The example method may also include creating the child table to be a reference-partitioned table partitioned according to the partitioning strategy associated with the parent table. The example method may also include creating the child table to be equi-partitioned with respect to the parent table. The child table is not to replicate a partition key of the parent table but rather is to inherit a partitioning key associated with the parent table through a foreign key relationship.

Abstract: Described is a technology in which a set of objects represent educational entities of an educational model, with relationships between objects. For example, a course object instance may have a relationship with a task instance and a user instance (such as representing a student). Other objects may include user credentials objects, group objects, degree program objects, course plan objects, institution objects, school objects, and/or department objects. The set of objects may be pre-defined and maintained in a persistent storage; this pre-defined set may be extended with an extended object that has relationships with pre-defined objects. The educational entities of an object model may be maintained in rows of a table, with each row having a field that identifies which entity is represented by that row. The table is accessed to determine relationships between an instantiated object for an entity and at least one other instantiated object for another entity.

Abstract: A system, framework, and algorithms for data deduplication are described. A declarative language, such as a Datalog-type logic language, is provided. Programs in the language describe data to be deduplicated and soft and hard constraints that must/should be satisfied by data deduplicated according to the program. To execute the programs, algorithms for performing graph clustering are described.

Abstract: A system and associated method for improving efficiency and data security of a relational database management system (RDBMS). Access path security is configured for respective users of the RDBMS, having either access-by-key or access-by-scan value. The access-by-key access path security requires an end user to specify a search key in a query as configured for the end user to service the query. Only few users with administrative capacity are configured with the access-by-scan access path security, which permits servicing queries in conventional ways without screening queries by scanning database. The RDBMS calculates the most efficient access path for the query received from the end user, and retrieves data requested by the query only when the calculated access path is permitted by the access path security for the end user.

Abstract: A system for creating queries for complex data structures includes a database populated with data relating to a manufacturing process and a graphical user interface accessed via a computer. The graphical user interface includes a tree domain and a query area, the tree domain including a tree representation of the data populating the database, wherein the tree representation includes graphical representations of attributes and/or structural-elements relating to the manufacturing process and populating the database. A mechanism is provided for dragging and dropping the graphical representations from the tree domain to the query area where the graphical representations are converted to a query based upon operators linking the graphical representations dragged and dropped from the tree domain.

Abstract: A method of performing a multi-way join of a plurality of database relations includes executing a plurality of pipelined two-way joins with the database relations. Each two-way join has two sequential phases. In the first phase, missing attributes of the input relations that are required to evaluate a joining criterion specific to said two-way join are fetched from a non-volatile memory device, and the input relations are joined according to the criterion. In the second phase, any additional missing attributes of the input relations are fetched from the non-volatile memory device as assigned by an optimization process executed prior to commencing the multi-way join.

Abstract: The hierarchical approach may start at the bottom of the hierarchy. As it moves up the hierarchy, knowledge from children and cousins is used to classify items at the parent. In addition, knowledge of improper classifications at a low level are raised to a higher level to create new rules to better identify mistaken classifications at a higher level. Once the top of the hierarchy is reached, a top down approach is used to further refine the classification of items.

Abstract: Embodiments relate to systems and methods for object-based modeling using hierarchical model objects. A modeling client can host modeling logic and an application programming interface (API) to create, access, manipulate, and import/export modeling objects used in modeling applications, such as engineering, medical, financial, and other modeling platforms. In aspects, the source data accepted into the modeling client can include consumer or business-level applications, whose spreadsheet, database or other content can be extracted and encapsulated in extensible markup language (XML) or other object-oriented format. Various model objects can be extracted from source data, and aggregated into a hierarchical model object encapsulating and preserving the underlying object layers. In aspects, one or more of the model object layers can functionally combine at least two other layers, to relate levels of data in hierarchical fashion.

Abstract: A computer implemented approach which identifies secondary entities associated with a (primary) entity selected by a user, and enables the user to find entity instances of interest by performing a search based on the attributes of the user selected primary entity and one or more of the identified secondary entities. In an embodiment, the secondary entities are identified based on a schema defining the entity types in a database system. The search may be used to retrieve (and provide to the user) only the entity instances matching the conditions specified based on the attributes of the primary entity and the secondary entities. The user interface may accordingly be simplified.

Abstract: Several methods and a system for analyzing ordered data using pattern matching over an indefinitely long ordered sequence of rows in a relational database are disclosed. In one embodiment, a method of a server includes receiving an ordered data in a relational database. The method further includes matching a pattern specified in a query on ordered data in a relational database in a single pass in constant space for overlapping mode of results. The method also includes creating an output data in the single pass in constant space for overlapping mode of results based on the matching of the ordered data with the pattern in the relational database query.

Abstract: The present invention relates to a method for generating an estimated value of a car, comprising the steps of receiving a user query specifying at least the type of a car; providing a database which comprises datasets having a car specification dataset specifying at least the type of the car and a car value field assigned to the respective car specification dataset representing the reference value of the car specified in the car specification dataset; searching in the database to find one or more datasets matching the user query; and calculating the estimated value of the car using the car value fields of the found datasets.

Abstract: Systems, methods and articles of manufacture are disclosed for batching heterogeneous database commands. The heterogeneous database commands may include at least two database command types. Further, at least two of the heterogeneous database commands may include host variables. A request to execute the heterogeneous database commands may be received. The heterogeneous database commands may be sent to a database system for execution, responsive to the request.

Abstract: Methods, devices and systems which facilitate the conversion of database objects from one schema version (e.g., an earlier version) to another schema version (e.g., a newer version) without requiring the objects be unloaded and reloaded are described. In general, data object conversion applies to both table space objects and index space objects. The described transformation techniques may be used to convert any object whose schema changes occur at the page-level.

Abstract: Described are methods and systems related to providing an analytical view of information present in one or more emails. Metadata of all the emails present in a mailbox is configured. The metadata includes an attribute of a corresponding email. Based upon the attributes of the emails, a relationship map is created. The relationship map is a multidimensional structure having multiple axes, with each axis describing an attribute of the emails. A query is received to query the mailbox. The query received is parsed to identify attributes of one or more relevant emails that are associated with the received query. A value is computed for each attribute of the relevant emails. Based upon the values computed for each attribute present in the relationship map, a resulting report having analytical view of information present in the relevant emails is rendered.

Abstract: Described is a technology, such as for representing scientific data and information, in which a database table contains rows of type data representing types, and term data representing terms that inhabit the types. Types include composite types (e.g., that represent entities), and instances of relation types that express relationships between types, between a type and a term, or between terms. Types and/or terms may have multiple relationships with one another, and a relationship may span database tables. A new relationship may be established by adding a new row to the database table to represent a new relation term, along with one or more similar rows to represent the relation role terms associated with that relation term; relationships may be removed by removing rows. As a result, the database table may change its state rapidly, without needing to change the database schema.