Abstract: A method for managing a binary object in a database system is provided. The method may include receiving a request to store the binary object and determining if a size of the binary object is above a first threshold. If the size is less than the first threshold, the method may include storing the binary object in a database of the database system using a database communication protocol. If the size is above the first threshold, the method may include determining if the size is above a second threshold. To this end, if the size is less than the second threshold, the method may include storing the binary object in a file system of the database system using the database communication protocol. Furthermore, if the size is above the second threshold, the method may include storing the binary object in the file system using a file system communication protocol.

Abstract: A method and apparatus implementing a “hadron” data structure architecture. In some embodiments, each hadron includes a frame identifier and a holder for a payload of data, wherein the plurality of hadron data structures are stored in a hadron block that provides a specification that includes metadata that specifies the payload. Some embodiments include a plurality of hadron blocks first and second hadron data blocks, each block including one or more hadron pages. Upon receiving data particles of a dataset, the system forms a first plurality of hadron data structures (hadrons) by creating a first frame identifier and associating the first frame identifier with a first data particle to form the first hadron, and creating a second frame identifier and associating the second frame identifier with a second data particle to form the second hadron, and stores the first plurality of hadron data structures in the first hadron page.

Abstract: A system and method for computing and transforming (1) a rating and (2) an indicator of the quality of the rating into (3) a new visual indicator which may be stored or output. A rating, also known as a score, can be the result of a survey or come from any other source. An indicator representing the quality of a rating can include a series of different colors, individual icons, a series of multiple icons, or written text. A new visual indicator is created from the combination of the rating and quality indicator. The system can analyze available data or accept human input and create an indicator of the quality of each rating or adjusted rating. The invention can create a new visual indicator by combining supplied or computed ratings and their computed quality indicators. The visual indicator may be stored as data elements or output on any capable device.

Abstract: A method and system for extracting Web content is disclosed. In one embodiment, Web content in a Webpage is extracted by identifying paragraphs in the Web content based on line-break node determination. A range of text-body associated with the identified paragraphs is then identified using a maximum scoring subsequence. Further, the identified text-body is refined using a heuristic rule of substantially horizontal alignment. Furthermore, one or more titles and one or more images associated with the Web content are extracted. Moreover, the Web content including the identified paragraphs, the one or more titles and the one or more images are outputted.

Abstract: A computer based system manages the collection, analysis and presentation of data. The system in one arrangement includes an online platform for collecting and unifying data across multiple channels. The platform also provides a vehicle for a plurality of users/groups to collectively analyze the data. The present system in one illustrative embodiment thus provides a data clearinghouse for gathering information from a plurality of channels, facilitating the sharing of this information, and facilitating the cooperative analysis of this information.

Abstract: A join operation between split data tables includes providing reduction data from first partitions to each partition among second partitions. The reduction data serves to identify actual values in one of the second partitions that also occur in one of the first partitions. Global IDs are assigned. Translation lists including the global IDs are sent to the first partitions. Each first partition and each second partition create globalized lists which can then be combined to generate respective first and second compiled lists. The join operation can then be conducted on the first and second compiled lists.

Abstract: Embodiments include methods for distributing visual display information related to a plurality of items to one or more display devices, and methods for rendering visual display information related to a plurality of items by a display device. Embodiments also comprise display devices, servers, and computer-readable media embodying one or more of these methods. Embodiments display of large data sets and associated statistics, such as trading activity of securities or other business statistics, on devices with limited-size display screen, e.g. smartphone or tablet. Embodiments enable visual navigation of large dynamic data sets via relative and absolute contextual statistics. Embodiments combine dynamic visual displays with a multi-tiered navigation structure, supporting more effective information gathering and processing across a variety of users with different objectives.

Abstract: Embodiments of the present invention relate to asynchronously replicating data in a distributed computing environment. To achieve asynchronous replication, data received at a primary data store may be annotated with information, such as an identifier of the data. The annotated data may then be communicated to a secondary data store, which may then write the data and annotated information to one or more logs for eventual replay and committal at the secondary data store. The primary data store may communicate an acknowledgment of success in committing the data at the primary data store as well as of success in writing the data to the secondary data store. Additional embodiments may include committing the data at the secondary data store in response to receiving an instruction that authorizes committal of data through a identifier.

Abstract: A method is provided that includes receiving a first triple including a subject, predicate and object, where the object is of a literal-type. For the first triple, then, the method includes identifying a subtype of the object; semantically marking the object with the identified subtype, including generating second and third triples; and storing the second and third triples in a triple store. In this regard, the second triple includes the subject and predicate of the first RDF triple as the subject and predicate thereof, and the third RDF triple includes the object of the first RDF triple or a representation of the object of the first RDF triple as the object thereof.

Abstract: A method for creating a specialized medical database uses software installed on a computer having a microprocessor and a database. The software allows a user to input search terms into the computer, whereby the software then searches the internet, including social media sites and chat rooms for posts that include the search terms. The posts are then analyzed by software that can obtain identification of the individuals. The software then contacts each of the individuals to verify the information in the post, to obtain additional information and to obtain contact information regarding each of the individuals' physicians. The software then contacts the physician to verify the information supplied by the individual. All of the information obtained in this process is then placed in a sortable format in the memory of the computer.

Abstract: A method for graphically displaying lifecycle information of a governed object in a service registry in combination with the policies associated with the lifecycle states. Properties (e.g., object type, current lifecycle state) are retrieved for a governed object. Additionally, lifecycle definitions for the current lifecycle state and one or more potential future lifecycle states associated with the governed object are retrieved. Furthermore, policy definitions that apply to the object type, the current lifecycle state and one or more potential future lifecycle states are retrieved. A table is then built that correlates the retrieved lifecycle definitions with the retrieved policy definitions. A graphical representation is generated detailing the current lifecycle state, transitions to the one or more potential future lifecycle states and the policy definitions that apply to each transition for the governed object based on the built table.

Abstract: A method, system and computer program product for graphically displaying lifecycle information of a governed object in a service registry in combination with the policies associated with the lifecycle states. Properties (e.g., object type, current lifecycle state) are retrieved for a governed object. Additionally, lifecycle definitions for the current lifecycle state and one or more potential future lifecycle states associated with the governed object are retrieved. Furthermore, policy definitions that apply to the object type, the current lifecycle state and one or more potential future lifecycle states are retrieved. A table is then built that correlates the retrieved lifecycle definitions with the retrieved policy definitions. A graphical representation is generated detailing the current lifecycle state, transitions to the one or more potential future lifecycle states and the policy definitions that apply to each transition for the governed object based on the built table.

Abstract: A search method is provided. The method comprises, building a first plurality of collectors, associating a first plurality of index entries with the first plurality of collectors, wherein each index entry comprises a search target and is associated with at least one of the first plurality of collectors based on a similarity between the search target of the index entry and the at least one collector, selecting a second plurality of collectors from among the first collectors based on a similarity between a search term and each of the second plurality of collectors, selecting a second plurality of index entries from among the index entries associated with the second plurality of collectors based on a similarity between the search term and the search target of each of the index entries associated with the second plurality of collectors, and presenting information related to the second plurality of index entries.

Abstract: Term negotiation can utilize centralized systems accessed via web interfaces for purposes such as mediation of communications between buyers and sellers, maintenance of a history of negotiations, and notification of parties regarding changes suggested during negotiation. Changes to terms proposed by parties using centralized systems can be stored in a data warehouse, potentially along with timestamp and identification information.

Abstract: A storage medium stores a program thereon. The program instructs a computer to perform a process.

Abstract: In a state where the migration source NAS apparatus is continuously operated, a migration processing program confirms the update date and time of files stored in the migration source NAS apparatus, and migrates only the files that were not updated from a specific time to the start date and time of migration processing. Or, the migration processing program migrates the files stored in the migration source NAS apparatus sequentially from the oldest file. The migration performance is calculated based on the capacity and migration time of the migrated files, and the time required for migrating the non-migrated files is calculated based on the size and migration performance of the non-migrated files.

Abstract: Provided is a technique for a data-driven database which frees a user from having to be conscious of a sequence in which instructions of a program for accessing a database are described, an interrelation of data items, and the like, and from having to describe redundant instructions. A data-driven database processor includes: schema definition storage means 2 for storing a schema definition of a database 24; derived definition storage means 3 for storing a derived definition describing a cause-and-effect relationship that exists when a value of a given data item is derived from a value of another data item; derived definition processing means 26 for generating a trigger program 27 that makes a chain of changes to values of data items based on the cause-and-effect relationship described in the derived definition; and a database management system 23 for executing the trigger program 27 when a change is made to the other data item that affects the value of the given data item.

Abstract: Mechanisms of memory management in a real time runtime environment having a garbage collected memory heap are provided. The runtime environment includes a critical real time thread that is precluded from accessing the garbage collected memory heap. The runtime environment further includes a scoped memory area for the allocation of objects therein for access by the critical real time thread. The mechanisms determine whether the critical real time thread currently accessing the scoped memory area is in a defined state so as to accommodate garbage collection of the scoped memory area. The mechanisms further initiate, in response to a determination that the critical real time thread currently accessing the scoped memory area is in the defined state, a process of garbage collection of the scoped memory area.

Abstract: A method for constructing a projection for storing data on a storage device may include causing a processor to extract characteristics of expected output of a query on the data, and to construct a projection for the data based on the extracted characteristics.

Abstract: A method and system comprising an analysis module to perform automated analysis of a process supported by a process system. The analysis is performed based on data quality information that indicates a quality of process data stored in datastores to facilitate performance of the process by consumption of the process data. The system may further include process model information defining a plurality of process activities, the automated analysis being based at least in part on the process model information. The data quality information may indicate the age, validity, completeness, integrity, consistency, and/or accuracy of the process data. The analysis may be to calculate a risk of failure of the process, or may be to diagnose a cause of process failure.

Abstract: A technique for mining pharmacophore patterns including computer-implemented methods for generating a database of pharmacophores and computer-implemented methods for classifying a query molecule with the database of pharmacophores. Generation of the pharmacophore database includes methods of defining a Joint Pharmacophore Space (JPS) using the three-dimensional geometry of pharmacophoric features of all active molecules against multiple targets.

Abstract: Techniques for initializing a connection in a peer-to-peer database replication environment. A message is received from an initiator node, indicating that the initiator node will begin replicating changes made to a particular data entity. One or more replicated changes relating to the database entity are received from the initiator node. If an updated instance of the data entity does not currently exist on a target node then one or more load operations are performed to create the updated instance. The stored replicated changes may then be processed against the updated instance of the database entity.

Abstract: Techniques are provided for accessing data within data repositories. Public UDTFs, private UDTFs and a metadata processor are utilized to provide access to data residing in a variety of data repositories.

Abstract: The present disclosure involves systems, software, and computer implemented methods for filtering business process logging information at runtime. One process includes receiving a set of logging information associated with execution of at least one entity, the at least one entity associated with a business process model defining a set of business process entities for performing a defined business process, identifying a process log filter rule associated with the entity, applying the identified process log filter rule to the received set of logging information to generate a filtered set of logging information associated with execution of the entity, and storing the filtered set of logging information in a process log associated with the execution of the entity. Identifying a process log filter rule associated with the entity can include identifying an entity property and determining at least one process log filter rule corresponding to the identified entity property.

Abstract: Disclosed is a user interface on a display for editing data transformations comprising an ETL process. A first display area presents a data representation of a data transformation. A second display area presents a view of input data, and a third display are presents a view of output data. User input to modify the data transformation is received. In response to receiving the user input, the third display area is updated with output data generated by applying the modified data transformation to the input data.

Abstract: Searching cached log blocks. A method includes performing a first search on cached log blocks for a log block having a first log block ID. The log blocks are cached and organized into sequentially ordered log buffers in memory. Adjacent sequentially ordered log buffers are double linked to each other. Each log buffer includes a complete range of log blocks from a starting log block ID to an ending log block ID. As part of the first search one or more links are followed, forward and/or backward, to one or more other log buffers. The method may further include determining that the first log block is not found by following one or more links forward and/or backward to one or more other log buffers and as a result, follow one or more covering pointers to one or more log buffers to search for the first log block.

Abstract: A system, method and computer readable media for disseminating data from a first entity to one or more additional entities is disclosed. The method comprises compiling a database of records of business transactions, receiving data from a business transaction recording system of a first entity, parsing the received data to determine if the received data is a new business transaction, automatically updating the database to reflect the new business transaction, and automatically disseminating the new business transaction to one or more additional entities.

Abstract: A technique for reducing reader overhead when referencing a shared data element while facilitating realtime-safe detection of a grace period for deferring destruction of the shared data element. The grace period is determined by a condition in which all readers that are capable of referencing the shared data element have reached a quiescent state subsequent to a request for a quiescent state. Common case local quiescent state tracking may be performed using only local per-reader state information for all readers that have not blocked while in a read-side critical section in which the data element is referenced. Uncommon case non-local quiescent state tracking may be performed using non-local multi-reader state information for all readers that have blocked while in their read-side critical section. The common case local quiescent state tracking requires less processing overhead than the uncommon case non-local quiescent state tracking.

Abstract: A data structure maintained in a computational device stores how many control areas splits have occurred to store a data set, wherein each control area split causes an addition of a single new control area. A command is received to add a new data record to the data set. A determination is made as to whether adding the new data record to the data set will result in a threshold for control area splits to be exceeded. In response to determining that adding the new data record to the data set will result in the threshold for control area splits to be exceeded, creating at least two new control areas in addition to continuing to use one existing control area for storing the data set.

Abstract: A recommendation information providing apparatus includes: a stay record managing section configured to store a stay record as a record when each of a plurality of users stayed in each of a plurality of locations; and a visit pattern calculating section configured to calculate a first visit pattern showing statistic data of the stay records for each of the plurality of locations. A candidate location extracting section extracts a second visit pattern to a specified location related to recommendation information from a plurality of the first visit patterns, extracts a third visit pattern which meets a determination value met by the second visit pattern from the plurality of first visit patterns, and extracts a similar location having the third visit pattern from the plurality of locations.

Abstract: A method and system are provided to support automated modification to a multiple node tree structure. Each clause and each logical operator are defined in the tree structure as nodes. In addition, each link emanating from a child node to a parent node is defined as a child link, and each link emanating from a parent node to a child node is defined as a parent link. The selection and location of an operator for placement in the tree structure will be automated in response to the position selected.

Abstract: A data structure maintained in a computational device stores how many control areas splits have occurred to store a data set, wherein each control area split causes an addition of a single new control area. A command is received to add a new data record to the data set. A determination is made as to whether adding the new data record to the data set will result in a threshold for control area splits to be exceeded. In response to determining that adding the new data record to the data set will result in the threshold for control area splits to be exceeded, creating at least two new control areas in addition to continuing to use one existing control area for storing the data set.

Abstract: Managing data by: receiving a group of individually accessible data units, each data unit identified by a key value, with key values determined such that the key value identifying a first data unit received before a second data unit occurs earlier in a sort order than the key value identifying the second data unit; and processing the data units for storage in a data storage system. The processing includes: storing blocks of data, the blocks being generated by combining a plurality of the data units; providing an index with entries that enable location, based on a provided key value, of a block that includes a data unit corresponding to the provided key value; and generating one or more screening data structures associated with the blocks for determining, based on a given key value, whether to search the stored blocks for a data unit corresponding to the given key value.

Abstract: A survey controller receives response records from response processing systems, wherein the response records comprise a selection of response records each identifying a separate response of at least one consumer to a particular stimulus within a consumer environment detected from a three-dimensional movement of the at least one consumer captured within the consumer environment. The survey controller stores response records in a response database. The survey controller calculates, from the selection of response records stored in the response database, statistics associated with the particular stimulus within the consumer environment. The survey controller stores, by the survey controller, the calculated statistics.

Abstract: A method for probabilistic processing of data, wherein the data is provided in form of a data set S composed of multidimensional n-tuples of the form (x1, . . . , xn), is characterized in that an n-dimensional data structure is generated by way of providing a bit matrix, providing a number K of independent hash functions Hk that are employed in order to address the bits in the matrix, and inserting the n-tuples (x1, . . . , xn) into the bit matrix by computing the hash values Hk(x) for all values x of the n-tuple for each of the number K of independent hash functions Hk, and by setting the resulting bits [Hk(x1), . . . , Hk(xn)] of the matrix. Furthermore, a respective system is disclosed.

Abstract: Data received from a data source is aggregated and filtered by parsing the data to determine an attribute related thereto. The data and attribute are added to a data structure that includes an automatically-generated history of a user's interaction with previously received data. A score is assigned to the received data based on its relationship to the previously received data. The data is outputted to the user if the score is greater than a threshold.

Abstract: The present invention relates to a method, apparatus, and system for data transmission based on a DLNA (Digital Living Network Alliance) network that classifies contents files which are stored in a DMS according to a support of the DLNA network to make a contents list. Support is provided to convert a file attribute of a selected file into a file attribute which can be applied to the DLNA network to generate, in case a user selects a non-supported file which is not applied to the DLNA network. The invention outputs the selected file to a display unit, captures the outputted image to convert into a file which can be applied to the DLNA network.

Abstract: Disclosed herein are systems and method for curating and distributing digital content; including: digital video, music, pictures, etc. For example, presented herein are systems and methods for providing a digital content program, including a plurality of continuously provided digital assets streamed over a digital content platform. Example embodiments include: (a) curating a plurality of assets; (b) selecting a subset of assets from the plurality of assets, based on similarity metrics between assets; and (c) ordering the subset of assets into a digital content program.

Abstract: A flexible, intelligent electronic procurement method and system that emulates and learns from the adaptive behavior of a user trying to find a product in an electronic catalog. The invention allows for searching heterogeneous catalogs in virtually any format, and does not require pre-defined hierarchies, nor the pre-loading of vendor catalog contents, nor the scrubbing of vendor data. It does not impose fixed structures on the user, and it does not force the user to think like someone else. Instead, the invention allows the user to choose their own way to navigate a catalog of items, and then by recording successful search scenarios and storing that knowledge in a dynamic collection of search paths, the invention organically evolves. As the collection of search paths can be accessed by other users, the utility of the invention increases over time once implemented in a given environment.

Abstract: The present invention is in the field of computer systems and processes for managing real and personal property. One aspect of the invention is directed to capturing history of a (real) property, which may include a description of the property, the personal property located on the real property, the projects and maintenance performed or to be performed on the property and their impact on the owner's tax basis in the property. Another aspect of invention allows for sharing of this history with an online community and for transferring the history (or portions thereof) on sale to a buyer.

Abstract: A data structure maintained in a computational device stores how many control areas splits have occurred to store a data set, wherein each control area split causes an addition of a single new control area. A command is received to add a new data record to the data set. A determination is made as to whether adding the new data record to the data set will result in a threshold for control area splits to be exceeded. In response to determining that adding the new data record to the data set will result in the threshold for control area splits to be exceeded, creating at least two new control areas in addition to continuing to use one existing control area for storing the data set.

Abstract: Exemplary non-transitory computer-readable medium, method and system for providing at least one recommendation to users and applications using multidimensional data. The multidimensional data can define a multidimensional space defined by a Cartesian product of the dimensions. The multidimensional space can have at least three dimensions, and each of the dimensions can be capable of (i) providing variable information, and (ii) having a type that is different from a type of another one of the dimensions. The exemplary non-transitory computer-readable medium, method and system can retrieve information from data associated with the multidimensional space. Further, the exemplary non-transitory computer-readable medium, method and system can generate the at least one recommendation based on the retrieved information. Further, at least one of the dimensions can include profiles.

Abstract: A system and method for keeping, organizing and managing electronic records, comprising generating a first instance of data objects comprising data elements during a first encounter, the elements comprising a first instance identifier and temporal identifiers; linking a data object to a summarization reference with a pointer; creating an additional instance of data objects also comprising data elements comprising an additional instance identifier and temporal identifiers during a later encounter; and providing continuity for the first instance data objects over time. Continuity may be provided by tracking a relationship between the first instance data object and an additional instance data object and repointing the pointer to point between the summarization reference and the additional instance data object. The additional instance data object may be a revision of the first instance data object, and tracking may occur by back-linking the revision to the first instance data object.

Abstract: In one embodiment the present invention includes a computer-implemented method of improving performance of schema matching. The method includes storing a matching topology that maps a first data structure to a second data structure. The method further includes identifying a first portion of the matching topology that is a candidate for improvement as determined according to an incidence graph. The method further includes rewriting the first portion of the matching topology with a second portion according to the incidence graph.

Abstract: A method for converting a distributed system includes providing a central database in communication with a database, in which the central database includes central schema information for accessing data stored in the central database. The method further includes transferring content data and schema information from the database to the central database for storage. The method further includes connecting schema information stored in the database to the central schema information such that each database is configured to receive a request for information, redirect the request from the database to the central database based on the referenced schema information, and receive, from the central database, the requested information.

Abstract: A computer program product, including: a computer readable storage device to store a computer readable program, wherein the computer readable program, when executed by a processor within a computer, causes the computer to perform operations for logging. The operations include: receiving a transaction including data and a log record corresponding to the data; writing the data to a data storage device; and writing the log record to a log space on a persistent memory device coupled to the data storage device.

Abstract: Storage drive logic and a standalone tape file structure are described. File transfer logic transfers file data to and from a network according to a first protocol. Media access logic accesses a sequential-access storage medium associated with the drive according to a second protocol. Media management logic translates file-based commands received from the network according to the first protocol into sequential-access device commands according to the second protocol. The device commands control accessing of data by the drive. The storage medium may be a magnetic tape including a data region for storing data in a file format, and a table of contents (TOC) region for storing a table of contents that indexes the locations of files within the data region.

Abstract: A method includes connecting an integration process to a first set of inputs. The first set of inputs may include one or more inputs. The integration process includes one or more data transformation operations using the inputs. The method further includes receiving metadata about one or more of the inputs in the first set of inputs. The metadata about one or more of the inputs in the first set of inputs is cached. The integration process is then connected to a second set of inputs based on the cached metadata about one or more of the inputs in the first set of inputs.

Abstract: Systems and methods for ensuring that a child receives proper nutrition specific to the child's developmental stage or pre-existing condition are provided. In a general embodiment, the present disclosure provides systems including a client device having at least one database, which has stored food consumption information and child characteristic information. The database further includes stored nutrient and food group recommendation information, and a rating system. Processors are used to calculate an average daily nutrition value of a child based on the food consumption and child characteristic information, compare the average daily nutrition value to the nutrient and food group recommendation information, and output a rating score based on the comparison.

Abstract: An event analysis system monitors information available from both publicly and privately distributed networks of information for events that are relevant to the user's particular business concerns. Those concerns are defined in a customized model of the user's organization and external business environment. The system receives the information, detects events in the information, interprets the events, and determines implications of these events. The detection and implication proceeds with regard to specific entities, relationships between entities, and definitions of the types of events which may occur in the environment in which the entities exist. Accordingly, the analysis system intelligently adapts its processing to recognize and report events which may be of interest for any particular entity.