Abstract: A method of transferring files in a data-processing network using a current node within the network includes reading an outbound content and outbound characteristics of an outbound file. An outbound message is created having outbound strings including a first set of the outbound strings representing the outbound characteristics and a second set of the outbound strings representing the outbound content. The outbound message is sent to a receiver node within the network. An inbound message is received from a sender node within the network. The inbound message has inbound strings including a first set of the inbound strings representing inbound characteristics and a second set of the inbound strings representing inbound content. An inbound file having the inbound content is stored, and the inbound characteristics are applied to the inbound file.

Abstract: The present design is a knowledge management system including a mapping engine configured to receive survey responses for a survey campaign completed by a survey participant and a set of mapping rules containing rules configured to map the survey responses to a set of knowledge resources specific to the activities, interactions and behaviors of a survey participant based upon the survey responses. The knowledge resources include information helpful to the survey participant to carry out a job related expected behavior or duty of the survey participant. The mapping engine is further configured to receive information about the activities and interactions of a survey participant, survey campaign, and knowledge resources that may be stored on a database, and transmit information about the set of knowledge resources to a designated entity, such as the survey participant or a system administrator.

Abstract: There is provided a method of context aware data-centric storage for dynamically changing a data storage range comprising: collecting data from entire sensor nodes, after establishing a data storage range of an entire sensor network, dividing areas, and transmitting a message of data storage range information to the entire sensor nodes by a base station; storing the collected data in a storage sensor node by determining whether there is a node responsible for storing the collected data to carry out operation depending on the determination result; determining whether the data storage has not been carried out for a period of time longer than a specified time in each sensor node after storing the data; and to determining whether the scale of invalid range is not smaller than ?.

Abstract: A method and system are disclosed that permit a host application to obtain cluster location data, for example logical addresses associated with the clusters of a file, and to allow a host application to communicate the logical block address mapping information to firmware of a storage device. The method includes the host transmitting one or more clusters or partial clusters having a signature to the storage device where the storage device knows or has been instructed by the host to look for the signature. The storage device may receive clusters having a signature and, responsive to a host request, return logical address information to a host for the location in the storage device of the marked clusters. The host may parse a data structure on the storage device to obtain remaining cluster location information using a file's first cluster location or may request that the storage device return the cluster location information.

Abstract: A versioning system determines an amount by which a first collection and a second collection of data objects overlap. The system divides the first collection of data objects into m possibly overlapping groups of average size s and computes one combined hash result for each group. The system then constructs a first sketch vector with n elements based on the combined hash results. A respective element of the first sketch vector is selected, using a selection function, from the combined hash results that are computed with the hash function corresponding to the element's index. Next, the system receives a second sketch vector for the second collection of data objects, and determines a sketch-vector overlap between the first and second sketch vectors. The system then computes a data-object overlap between the first and second collections of data objects based on the sketch-vector overlap.

Abstract: Proposed is a data visualizing apparatus for visualizing data as effectual information using a correlation between forensic data collected from various sources. The proposed data visualizing apparatus may visualize, as effectual information, single-source single-data, single-source multi-data, and multi-source multi-data.

Abstract: A technique for resizing a first RCU-protected hash table stored in a memory. A second RCU-protected hash table is allocated in the memory as a resized version of the first hash table having a different number of hash buckets, with the hash buckets being defined but initially having no hash table elements. The second hash table is populated by linking each hash bucket thereof to all hash buckets of the first hash table containing elements that hash to the second hash bucket. The second hash table is then published so that it is available for searching by hash table readers. The first table is freed from memory after waiting for a grace period which guarantees that no readers searching the first hash table will be affected by the freeing.

Abstract: A system and method for parallel processing of semantically grouped data in data warehouse environments is disclosed. A datastore object having a number of records is generated in a data warehouse application. A hash value is added to each record. The hash value has an integer domain, and is uniformly distributed over the integer domain across the datastore object. A selection table is generated to create a number of tasks based on discrete ranges of the hash value. Then, a transformation routine is executed on each of the number of tasks in parallel to generate an infocube of data that corresponds to each range of the discrete ranges of the hash value.

Abstract: A technique for resizing a first RCU-protected hash table stored in a memory. A second RCU-protected hash table is allocated in the memory as a resized version of the first hash table having a different number of hash buckets, with the hash buckets being defined but initially having no hash table elements. The second hash table is populated by linking each hash bucket thereof to all hash buckets of the first hash table containing elements that hash to the second hash bucket. The second hash table is then published so that it is available for searching by hash table readers. The first table is freed from memory after waiting for a grace period which guarantees that no readers searching the first hash table will be affected by the freeing.

Abstract: Methods of generating filters automatically from data processing jobs are described. In an embodiment, these filters are automatically generated from a compiled version of the data processing job using static analysis which is applied to a high-level representation of the job. The executable filter is arranged to suppress rows and/or columns within the data to which the job is applied and which do not affect the output of the job. The filters are generated by a filter generator and then stored and applied dynamically at a filtering proxy that may be co-located with the storage node that holds the data. In another embodiment, the filtered data may be cached close to a compute node which runs the job and data may be provided to the compute node from the local cache rather than from the filtering proxy.

Abstract: A computer-implemented method and system for encoding (and decoding) nodes of a tree structure are provided. The method includes receiving nodes of a tree structure into memory and, with a processor, for each node of at least one node in the tree structure, creating a numeric encoding by assigning an encoding value to the node, a root node N0 having a fixed encoding value and any other node Nj having an encoding value which is a function of an encoding value of its parent node and an integer k, where Nj is the kth child of the parent node. The encoding enables a path from the node to be traversed to the root node of the tree by applying a decomposition function to the encoding.

Abstract: Embodiments of the invention relate generally to electrical and electronic hardware, computer software, wired and wireless network communications, and computing devices, and more particularly, to a system, an apparatus and a method configured to generate arrangements of data, including data catalogs, to facilitate discovery of items via an interface depicting item representations based on similarity of one or more attributes. In one embodiment, a method includes receiving data representing a request to transmit data; executing instructions at a processor to determine the relationships of the item representations to the principal item representation for records stored in a memory, associating the item representations to positions of a data arrangement based on the relationships of the item representations.

Abstract: A navigation mechanism for hierarchical data uses a climb/dive and rotate inputs to traverse a hierarchical dataset. The hierarchical dataset may be arranged in a filial-heir arrangement for easy traversal. The navigation mechanism may be used with several different ways of displaying the data, some of which may display both overall context and detailed view of the data. One such example may have a context section and a detail section, where the context section may present the overall context of a focus node in relation to the overall dataset and the detail section may display other nodes that are at the same or lower level than the focus node.

Abstract: According to one general aspect, a method may include receiving a virtual data field definition from a user interface model. The virtual data field may include a data field does not have a counterpart in a database of actual data fields. The method may include dynamically generating the virtual data field based upon the virtual data field definition. The method may include responding to a data request from the user interface with a plurality of data fields, wherein the plurality of data fields include both the virtual data field and an actual data field included by the database.

Abstract: A mixed join between database column and row tables employs an algorithm that recognizes both row and column store, and is executable upon the data in its native form (row or column) without requiring conversion between orientations. The native mixed join algorithm accesses the column dictionary of the column table for efficient join processing. The native mixed join algorithm may also exploit an inverted index (if present) to search a record (e.g. docid) with a given value. In particular, the native mixed join algorithm looks up a column dictionary for a join condition, while iterating the row table and returning matched records in a pipelined manner.

Abstract: Various embodiments of systems and methods for aligning records for visual comparison are described herein. In one aspect, the method includes identifying a plurality of records. A reference record is selected from the plurality of records. One or more non-reference record is merged into the reference record to generate a merged reference record. The merged reference record includes one or more fields missing in the reference record. The missing fields are included as blank fields from the non-reference records. The merged reference record is merged into a non-reference record to generate the merged non-reference record. The merged non-reference record includes fields missing in the non-reference record. Missing fields are included as blank fields. The merged records are displayed on a user interface in a card view.

Abstract: Disclosed herein is a method of integrating data of an XML document with a DB on a web. In the method, an XML document provided with user-defined tags is designed. An XSL format document for normal data mapping and an XSL format document for repetitive data mapping are designed. Mapping information required to map the normal data and the repetitive data of the XML document to the XSL format document for normal data mapping and the XSL format document for repetitive data mapping is created. An XSL document for normal data mapping and an XSL document for repetitive data mapping are generated using the mapping information. An SQL query statement required to integrate the normal data and the repetitive data of the XML document with a DB is generated. Data of the XML document is integrated with the DB by executing the SQL query statement on the DB.

Abstract: A system includes creation of a first data structure defining a generic business object model in a storage medium of a first device, creation of a second data structure defining a specific business object model in the storage medium of the first device, where the specific business object model being an instance of the generic business object model, reception of the second data structure defining the specific business object model at a mobile device, and storage of the second data structure in a storage medium of the mobile device.

Abstract: A diagnostic system includes one or more processors for executing machine-executable instructions and one or more machine-readable storage media for storing the machine-executable instructions. The instructions include a plurality of traces. Each trace is a trace of events executing on a computing system. The system also includes processing logic configured to partition data in the trace into a first trace independent component which includes trace-independent information and a second trace dependent component which includes trace instance information. The system further includes a memory for storing the first trace independent component in a first data structure and the second trace dependent component in a second data structure.

Abstract: A method identifies electric load types of a plurality of different electric loads. The method includes providing a hierarchical load feature database having a plurality of layers; including with each of a plurality of the layers a corresponding load feature set, the corresponding load feature set of at least one of the layers being different from the corresponding load feature set of at least another one of the layers; including with one of the layers a plurality of different electric load types; sensing a voltage signal and a current signal for each of the different electric loads; determining at least four different load features from the sensed voltage signal and the sensed current signal for a corresponding one of the different electric loads; and identifying by a processor one of the different electric load types by relating the different load features to the hierarchical load feature database.

Abstract: A method identifies electric load types of a plurality of different electric loads. The method includes providing a load feature database of a plurality of different electric load types, each of the different electric load types including a first load feature vector having at least four different load features; sensing a voltage signal and a current signal for each of the different electric loads; determining a second load feature vector comprising at least four different load features from the sensed voltage signal and the sensed current signal for a corresponding one of the different electric loads; and identifying by a processor one of the different electric load types by determining a minimum distance of the second load feature vector to the first load feature vector of the different electric load types of the load feature database.

Abstract: A data structure that includes a user profile including user profile information, and a data structure comprising a set of available telephone numbers can be accessed. A targeted list of one or more telephone numbers can be generated using the set of available telephone numbers and information from the user profile. The targeted list can include one or more telephone numbers from the set of available telephone numbers that match at least a portion of the user profile information. Also, the targeted list can be sent to a rendering computing environment for display. User input selecting a telephone number from the targeted list can be received. In response to user input, the selected telephone number can be associated with a user profile in a data structure.

Abstract: The present invention relates to a query definition apparatus and method for multi-tenant. The query definition apparatus includes a schema generation unit for, when a tenant accesses a Software as a Service (SaaS) system, generating a basic schema required to execute an application program requested by the tenant on a SaaS platform. A schema editing unit edits the basic schema in response to a request of a tenant manager. A query definition unit is configured to, when the basic schema is edited, provide a query definition interface required to define queries for the edited schema to the tenant manager, and define a query statement by extracting corresponding queries depending on manipulation of the query definition interface.

Abstract: A computer implemented system and method for enabling a database write operation for an application that only has a database read operation is disclosed. At least one data source is stored in a database, the data source having at least one pre-coded stored write operation. A database read operation that calls the data source is received. The read operation is performed on the database, the read operation causing the database to execute the pre-coded stored write operation on the database.

Abstract: Methods for generating a data fetching plan in a multi-tenant system include placing tenants in consecutively allocated databases according to a weighted graph of tenants and sharing relationships between tenants, where at least one sharing relationship includes multiple accessing tenants accessing a given set of data from a provider tenant. For each sharing relationship, if a current database has one or more accessing tenants and does not have the provider tenant, data is fetched from the latest-allocated database prior to the current database that has accessing tenants, if such a database exists; if a current database has the provider tenant, data is provided to the earliest-allocated database after the current database that has accessing tenants if such a database exists. The fetching and providing steps are repeated for each allocated database.

Abstract: A proximity alert system includes a non geographically based information set with non-geographical based input characteristics associated with an individual that are from online sources. Further included is a geographically based database with geographically based input that is also associated with the individual that are also from online sources. In addition, a query component based upon a member initiated search for the selected individual includes a geographic tag for each selected individual. Also included are programs having instructions for executing the member initiated search in the non geographical and geographical databases that outputs a search result that matches the member initiated search, plus instructions to map a proximate path as between the member geographic tag and the selected individual geographic tag, wherein operationally the member can view the selected individuals associated information that include geographic mapping between the member and the individual.

Abstract: A method for tenant placement in a multi-tenant system is shown that includes creating a weighted graph of tenants and sharing relationships between tenants, where a weight for each tenant and each sharing relationship represents an associated degree of resource consumption; and adding one or more tenants to a database using a processor based on said weighted graph and a database capacity, such that the combined weight of the added tenants and the sharing relationships belonging to the added tenants are within the database capacity. If a tenant cannot be added to the database without exceeding the database capacity, a new database is created and the one or more tenants are added to the new database, subject to a new database capacity. The adding and creating steps are repeated until all tenants have been added to a database.

Abstract: An automation control and monitoring system is provided that includes an automation control component and a data store. The automation control component is configured to store measurement data acquired from a sensing component of the automation control system in onboard memory. The automation control component is configured to store the measurement data in the onboard memory in a manner defined by a data structure of the measurement data. The data store is configured to store and dynamically associate meta-data with the measurement data acquired from the sensing component such that the meta-data extends the data structure by linking at least portions of the meta-data with the measurement data.

Abstract: A computer-implemented method and apparatus for fabricating data for database applications. The method comprises intercepting a command issued by an application, the command being addressed to a database; formulating a problem in accordance with the command; obtaining a solution for the problem, the solution comprising fabricated data; providing a second command for updating the database with the fabricated data; and providing the command to the database, whereby a response from the database based on the fabricated data is provided to the application.

Abstract: A toolbar extension of a web browser suggests a user try searching a different search engine than the one on which the user has just conducted a search. The toolbar detects the user is frustrated with the search results returned by the search engine by monitoring a number of session heuristics. Analyzing historical user session, log, and click data of other users who have submitted the search query to different search engines, a different search engine is selected that has historically generated better search results. A suggestion is then presented to the user to run the search query in the more effective search engine. Such a suggestion may be presented in a number of ways, but one embodiment displays a window next to the text field of the toolbar and provides a link to conduct a search for the search query in the more effective search engine.

Abstract: A system and method identifies pre-fetch map data to be downloaded from a remote server, having a map database, to a client device by using selectable parameters to control pre-fetching. For example, device specific parameters, such as device model number, and user specific parameters, such as user interests, may be accessed by the system and method and analyzed to determine which pre-fetch map data should be downloaded from the remote server. These parameters may be automatically stored on the client device or may be manually entered by the user. The responsive pre-fetch map data may be identified by map data type, map points of interest, map zoom level, or some other manner. Where the map database stores map data in tiles, the remote server will send selected map data tiles to the client device as the pre-fetch map data.

Abstract: A method and apparatus for facilitating answering a query on a database. Example embodiments include: accessing a database tree having a plurality of nodes; receiving a set of input variable values, a non-empty set of output variables, and information indicative of a node in the database tree; determining a traversal cost based on the node and the set of input variable values; determining a lower bound based on the node and the set of input variable values, wherein the lower bound corresponds to an upper-bound probability estimate based on one or more of the plurality of nodes and the set of input variable values; pruning one or more of the plurality of nodes based on the traversal cost, the lower bound, and a pruning bound; and returning a result including a non-empty set of output variable values based on the set of input variable values, the node, the traversal cost, and the lower bound.

Abstract: Clustering and synchronizing content may include extracting audio features for each of a plurality of files that include audio content. The plurality of files may be clustered into one or more clusters. Clustering may include clustering based on a histogram that may be generated for each file pair of the plurality of files. Within each of the clusters, the files of the cluster may be time aligned.

Abstract: A showing system and a showing method for product materials are provided. In this showing method, a material module database is created and stored, which includes a number of three-dimensional material modules corresponding to a number of material information and a number of module class information corresponding to the material information. A preview database is created, which includes the material information, a number of preview modules and a number of preview class information corresponding to the material information. The preview modules and preview class information in the preview database are timingly adjusted according to the three-dimensional material modules and the class information in the material module database. A user interface receives the material information to display the corresponding preview modules and the preview class.

Abstract: Changes to a hierarchical organizational structure may be stored in different versions of a data structure depicting the hierarchical organizational structure. Each of these versions may include a validity period field representing a time period that the hierarchical organizational structure depicted in the version accurately reflects the organizational structure of the organization. Each of the versions may also be designated as active or inactive. In some instances, each of the versions may be designated as inactive except for a version that reflects the organizational structure of the organization at a particular time, which may change over time. Historical copies of versions may be stored and subsequently recalled to identify an organizational structure that was in effect at a particular time in the past. The recalled version may then be used to limit the results of a query to a selected node of the historical organizational structure.

Abstract: A dynamic call on dynamic data can be transformed into a dynamic call on a structure representing dynamic data. Specifically, a dynamic query with a code object representation that includes an untyped parameter can be transformed into a dynamic query with a function call with a dynamic meta-object. The function call with the dynamic meta-object tracks operation(s) that correspond to the code object representation that includes an untyped parameter in order to build a structure representing such code object representation. At runtime, the dynamic query is built and the structure representing the code object representation is rebuilt so as to enable a dynamic query with a code object representation that references untyped data.

Abstract: Methods, systems, and computer program products are provided for capturing snapshots of database models. Metadata of a database model is captured. A database model snapshot object is generated based on the captured metadata. The generated database model snapshot object is transportable, extensible, secure, and human readable. Furthermore multiple database model snapshot objects may be compared to each other to determine differences in database models in different database systems, to track how a database model of a database system is changing over time, to track how database source projects evolve over time and/or for other uses.

Abstract: There are provided a system, a method and a computer program product for managing corporate memory. A user creates at least one rule that maps an organization scheme of electronic data in the user's individual computer to a semantic and structure of a corporate database. The system automatically transforms the electronic data in the user's individual computer to a format for storing in the corporate database according to the created rule. The system automatically uploads the transformed electronic data into the corporate database.

Abstract: A database has a plurality of elements, where each element is associated with a location and at least one set of different attribute values, wherein each set includes a timestamp when the attribute values in the set were determined. A determination is made of a reference geographical location, an element having a geographical location within a geographical region including the referenced geographical location, a most recent set of the attribute values for the element having a most recent timestamp, a previous set of attribute values for the determined element comprising the set of attribute values having a previous timestamp prior to the most recent timestamp, and whether a condition with respect to at least one of the most recent set of attribute values and the previous set of attribute values of the determined element is satisfied.

Abstract: A plurality of free list data structures are maintained in a multi-processor computing system that each correspond to one processor of the multi-processor computing system and that each comprise an ordered queue of processor-specific items. Thereafter, a number of processor-specific items allocated to each free list data structure is calculated. Processor-specific items allocated to a first of the free list data structures are moved to a second of the free list data structures when the number of calculated processor-specific items in the first free data structure exceeds a first threshold. In addition, processor-specific items allocated to the second of the free list data structures are moved to the first of the free list data structures when the number of calculated processor-specific items in the first free data structure is below a second threshold. Related apparatus, systems, techniques and articles are also described.

Abstract: Methods, system and computer readable medium for allowing user interaction to an article on an Internet property includes detecting a selection of the article for viewing, by a user. Comments and interactions for the article provided by one or more posters are retrieved, wherein the posters are independent contributors that are not related to the user. A select subset of the comments/interactions for the article are presented to the user in an ordered list based on an association strength between the user and each of the posters related to the subset of the comments/interactions. Interaction, by the user, with a comment/interaction provided by a poster, is monitored and the association strength between the user and the relevant poster is updated based on the interaction. The updated association strength is used to adjust ranking of the comments/interactions for presenting to the user during subsequent selection.

Abstract: Techniques are disclosed for accessing a dimensional data model when processing a query. In one embodiment, the query is processed by performing a two-stage zigzag join operation including a zigzag main join and a zigzag back join. The zigzag main join is configured to generate a set of row identifiers of fact records satisfying any local predicates in the query. The zigzag back join is configured to generate query results based on the set of row identifiers. The query results are returned responsive to the query.

Abstract: Technologies are generally described for cache based key-value store mapping and replication. In some examples, key-value stores may be mapped for data structure replication through extraction of file breaks in an existing key-value store by iterating through the store and examining changes in cache addresses to detect jumps in address values. Specially formulated queries may be executed to return the values within an address range that spans a physical storage volume in order to recover full key-value sets that are physically grouped at a current data center including record duplicates. Such sets may be used to replicate or inform the key-value sets at a new location or in a new key-value store allowing construction of a replicated database tree structure complete with record duplications that develop as tables are optimized over time.

Abstract: The subject disclosure relates to third party cloud schema matching to a user's data. The user can select the type of data to be looked up from an external source in order for the user's data to be augmented with data from the external source. The user can be presented with a list of service providers that support the selected type of data. Columns from the user's data are associated with supported lookup information types either automatically or manually. Based on the association, data from the external data source is automatically mapped to the user's data and updates are selectively applied to the user's data.

Abstract: Computer-implemented systems, methods, and computer-readable media for storing and presenting content according to a story narrative include hosting a data set including a plurality of entries, wherein each entry is individually addressable in the data set and wherein an entry is a story stream; receiving a new entry; storing the new entry in the data set; receiving from an editor an indication that the new entry is a stream entry associated with the story stream; associating the stream entry with the story stream; and providing an interface for navigation of the story stream and the entries associated with the story stream.

Abstract: Through proactive structured dataset management, suggestions are made for dataset enrichment, cleansing, and other enhancements. Users need not go looking for potentially helpful datasets online or in an enterprise filesystem, because relevant datasets and services will be automatically suggested, based on a samplex cast from the user's dataset. Enrichment may add typed attributes, rows, and/or cell values from a matching dataset, may cleanse data, and may add another dataset which has data about the same entity as the original dataset. Proactive dataset and service matching occurs inside a security perimeter to protect confidentiality. Confidence in suggested modifications may be shown by color differences. Modifications may be previewed, and kept or reverted after acceptance. Suggestions are made in from-example or from-scratch scenarios.

Abstract: Containers that store data objects that were written to those containers during a particular backup are accessed. Then, a subset of the containers is identified; the containers in the subset have less than a threshold number of data objects associated with the particular backup. Data objects that are in containers in that subset and that are associated with the backup are copied to one or more other containers. Those other containers are subsequently used to restore data objects associated with the backup.

Abstract: Described is a reliable and efficient design for a transactional status oracle (“ReTSO”), which supports large-scale storage systems. ReTSO uses a centralized scheme and implements snapshot isolation, a property that guarantees that read operations read a consistent snapshot of the data store. The centralized scheme of ReTSO enables a lock-free commit algorithm that prevents unreleased locks of a failed transaction from blocking other transactions. Each transaction submits the identifiers of modified rows to the ReTSO, the transaction is committed only if none of the modified rows is committed by a concurrent transaction, and a log of the committed transaction is cached. To recover from failures, before a client is notified of a change, the change cached is first persisted into a write-ahead log, such that the memory state can be fully reconstructed by reading from the write-ahead log. Furthermore, ReTSO implements a lazy, auto-garbage collector hash map that reduces the number of memory accesses per request.

Abstract: A method for modeling a test space is provided. The method comprises defining a coverage model including one or more variables, wherein respective values for the variables are assigned, one or more definitions of value properties for said variables with assigned values, and one or more restrictions that limit combination of variable values that are legal for the model, wherein at least one of said restrictions is defined using at least one value property.

Abstract: A non-transitory computer-readable storage medium, storing one or more programs configured for execution, the one or more programs for monitoring, transmitting, and recording usage of a computer or mobile device connected to a network, the one or more programs including instructions for establishing a first account, the settings of the first account being stored in a database; establishing a second account, the settings of the second account being stored in the database, wherein the second account includes a wish-list; linking the first and second accounts such that control settings of the second account are determined through the first account; and making a purchase from the wish-list of the second account consistent with the control settings of the second account.