Abstract: After receiving a first user request including a first set of search keywords, a computer identifies a first set of chunks within multiple documents, wherein each chunk includes terms matching the first set of search keywords, and displays at least a portion of the first set of chunks, including highlighting the terms matching the first set of search keywords in the displayed portion in a first manner. After receiving a second user request to search among the documents for documents that satisfy a second set of search keywords, the computer identifies a second set of chunks within the documents, wherein each chunk includes terms matching the second set of search keywords, and displays at least a portion of the second set of chunks, including highlighting the terms matching the second set of search keywords in the displayed portion in a second manner that is different from the first manner.

Abstract: Compression of relational table data is enhanced with a pre-compression step of mapping the values of each field. Illustratively, the data in each cell of the relational table is replaced with a number a smaller number of characters. Additionally side information that is necessary for reversing the mapping is also compressed.

Abstract: A method and apparatus for obtaining media program metadata is disclosed. In one embodiment, the method comprises the steps of receiving a media program callback message in a content delivery system from a client device displaying a webpage retrieved from a host server, the media program embedded in the retrieved webpage, the callback message comprising a callback address to the webpage, and storing the address as metadata associated with the media program in the database.

Abstract: A dispatching system adjusts resources to meet real-time changes in demand. When a customer requests service, a work assignment is generated and sent to an employee. When a customer cancels the requested service, a cancellation code is sent to the employee. The cancellation code informs the employee that the work assignment has been canceled.

Abstract: Techniques are provided for transporting subset of databases containing binary XML data. In one embodiment, a method is provided that allows transporting binary XML data that conforms to schema by also transporting the schema entries that are necessary to derive the binary XML. In another embodiment, a method is provided that allows transporting binary XML data that does not conform to schema by also transporting the token tables that contain the mapping for the binary XML.

Abstract: Disclosed are systems, apparatus, methods, and computer readable media for discontinuing the following of records in an on-demand database service environment. In one embodiment, one or more records are identified according to one or more designated criteria. The records are stored in a database. The records are being followed by one or more users in an on-demand database service environment such that updates to the records are capable of being stored as feed items in one or more feed tables in the database. The feed items are capable of being published in an information feed displayed on one or more devices associated with the one or more users. The following of the identified one or more records by the one or more users is discontinued.

Abstract: Data series are stored at multiple resolutions in a computer-readable data storage medium. In particular, time series data values of the data series are received with associated timestamps. Corresponding storage elements in the computer-readable data storage medium are identified based on the time stamps. Aggregate values are determined by summing the time series data values. The time series data values stored in the corresponding storage elements are replaced by the aggregate values. Combined data values of the aggregate values are stored in storage elements in the computer-readable storage medium at a first resolution and second resolution, where the second resolution is half of the first resolution.

Abstract: Devices, methods and systems for processing database queries formatted differently than the database storage model being queried are disclosed. Processing database queries independent of the storage model of the queried database may be performed by receiving a query for one or more data items stored in a database, determining whether to use at least one query operator that uses data having a format different from the storage model format of at least one of one or more data items stored in the database and converting the format of the data used by the at least one query operator to a format that matches the storage model format of at least one of one or more data items stored in the database. Related systems, methods, and articles of manufacture are also described.

Abstract: Method and system for application isolation is provided. A computing system executes a plurality of processor executable applications and each application is assigned an address by an adapter that is operationally coupled to the computing system. The adapter also assigns a unique identifier to each construct generated by the plurality of applications; maintains a data structure associating the address with the unique identifier assigned to each construct; receives a request having an address and a unique identifier from an application from among the plurality of applications; retrieves the address and the unique identifier from the request; compares the retrieved address and the unique identifier with information maintained by the data structure; and processes the request if the retrieved address and the unique identifier matches with information of the data structure.

Abstract: Audio information is recorded in an overwriteable circular buffer of a computing device. Construction of a search query is initiated by receiving a user input. The user input includes one or more keywords forming a user-defined portion of the search query. At least a portion of the audio information recorded in the overwriteable circular buffer is processed to obtain one or more additional keywords forming an expanded portion of the search query. The portion of the audio information containing the additional keywords is received and recorded in the overwriteable circular buffer prior to receiving the user input. The search query including the user-defined portion and the expanded portion is supplied to a search engine. A response to the search query is received from the search engine. The response is generated by the search engine based on the user-defined portion and the expanded portion of the search query.

Abstract: Techniques are described for data redistribution. Embodiments store a first set of receiver location identifiers mapped to a document identifier and assigned to a first set of receiver locations storing relational data referencing the document identifier. Embodiments store a second set of receiver location identifiers mapped to the document identifier and assigned to a second set of receiver locations storing document data corresponding to the document identifier referenced by the relational data. Sender index keys are received separately from the relational data and the document data, the sender index keys referencing the document identifier and containing sender location identifiers. Embodiments determine, from the first set of receiver location identifiers and the second set of receiver location identifiers, which receiver location identifiers are mapped to the document identifier referenced by the sender index keys.

Abstract: A method and system for determining a service description that most closely matches a service name. A ranked service name list is generated by use of a name parser, a dictionary, and a name composer, wherein the ranked service name list comprises at least one alternative service name and a respective rank of each alternative service name of the at least one alternative service name, and wherein the respective rank indicates how closely the alternative service name associated with the respective rank resembles the service name provided by the user. It is ascertained that the service description matches the highest ranked alternative service name in the service name list. The service description matching the highest ranked alternative service name is communicated to the user.

Abstract: An automated researching component is invited to contribute content to a collection of research material. The automated research component can be set to continue to add content at a given pace, or for a given duration of time. The automatically added content is added to the collection, along with manually added content.

Abstract: A dynamic content system integrates dynamic and static content through entry of physical table and field structures and creating metadata describing the physical structures. A formula engine with a cascading formula detection engine calculates fields, and a dynamic meta-assembly engine dynamically generates code for the dynamic content. A dynamic meta-reporting engine with a dynamic meta-query engine reports content. An access control engine and workflow engine integrate into the dynamic content system to provide content permissions and routing.

Abstract: The present application is directed to a data management system. The data management system is implemented within a computer system that includes one or more processors, one or more electronic memories, and a memory-mapped file facility that electronically stores data. The data management system, implemented by data management system control routines that are executed by the one or more processors, retrieves a particular projection of a multi-level, multi-dimension data set stored within the ONP-tree data structure that contains the multi-level, multi-dimension data set.

Abstract: A middle layer in business applications is provided to wrap all the database management operations generically, to store changed data temporarily, to validate and lock the data before updating the database, and to synchronize the data change and unlock it as a whole when a commit method is called. In embodiments, only six generic methods are needed for all data interactions. Transaction, isolation level, exception format, and performance tuning operations can be performed centrally in the six generic methods. A buffer section may be created in the middle layer. Operations such as insert, update, delete, and select are performed on data stored in the buffer. Buffered data may then be stored in a data storage device.

Abstract: The navigation overhead and/or the content managing/updating overhead is reduced by providing link objects with condition data being associated with the link items of the link objects so that, depending on a check as to whether the condition data is fulfilled or not, an automatic handling of a link object may be performed. For example, the automatic handling may have an automatic appointing an object ID referred to by a link item of the link object that has condition data associated therewith which is fulfilled, as a newly-selected object ID.

Abstract: An Internet-based system capable of automatically maintaining contact-related information in any computer software application or digital device which stores or manages contact-related information. More particularly, the system allows users to automatically enter and maintain contact-related information in a digital address book or similar application or device (such as a wireless phone or PDA) with minimal or no manual entry of the contact-related information by the user. The system also allows contacts of the user (i.e. people who's contact information or partial contact information is present in the user's address book application) to make corrections to their contact-related information contained in the user's address book, request reciprocal contact information from the user, deny the user access to additional or corrected contact-related information and take other actions relative to managing the contact-related information which others (users) have about them.

Abstract: The invention provides a method, system, and program product for managing data for data aggregation, including data mining and reporting. Locations of a plurality of data to be collected are determined within a source database. Data are simultaneously collected from the plurality of locations and aggregated. The aggregated data are normalized by adding an encryption key and the normalized data are stored. Data at each of the plurality of locations are then released in the source database.

Abstract: A system, method and database design is provided for unifying data from a plurality of databases, each having business-context related data and a data access mechanism. A database is created which contains a node for each dimension of an industry. For each data source accessible via the system, a set of data source specific dimensions is created and mapped to the corresponding industry business context dimension(s). A set of templates (e.g., UniViews) is created to query the data sources. Each UniView contains a specific question for a specific dimension designed for a specific data source. A central server coordinates the system and facilitates use of the system through an interface (e.g., the UniViewer). UniViewer allows a user to query the data sources by identifying an industry business context dimension, a dimension instance and at least one UniView. Multiple UniViews can be combined, cached and saved to facilitate complex queries.

Abstract: A digital archive system includes a plurality of digital files and a user interface that allows a user to designate any one of the files as an anchor file and to link other ones of the files to a designated anchor file. The user interface allows a user to annotate each file linked to an anchor file with information describing the respective file and any relationship between the anchor file and the respective linked file. The content of an anchor file and all files linked thereto can be displayed via the user interface.

Abstract: A computer identifies a plurality of data retrieval requests that may be serviced using a plurality of unique data chunks. The computer services the data retrieval requests by utilizing at least one of the unique data chunks. At least one of the unique data chunks can be utilized for servicing two or more of the data retrieval requests. The computer determines a servicing sequence for the plurality of data retrieval requests such that the two or more of the data retrieval requests that can be serviced utilizing the at least one of the unique data chunks are serviced consecutively. The computer services the plurality of data retrieval requests according to the servicing sequence.

Abstract: Uniform subject and object oriented data structure adopted in computing device to efficiently store, distribute and process data in a variety of applications. Said data structure comprised of multiple complementary subparts that together and independently facilitate communication (of inputs and outputs) through one or more defined interfaces to facilitate secure access and coordination between given individual subject(s) and other real (physical or metaphysical) entities. Methods are also disclosed that work in tandem with the data structure and interface components to enable and require a single or given human user or other individual personal subject (belonging to a secure AFFIRM network) to maintain exclusive (private) self-control over at least one virtual domain that represents themselves (their actions and their relationships).

Abstract: Systems and methods are disclosed for early access to captured images including generating and storing within a geospatial database a plurality of placeholder records having information identifying a particular captured image and including at least one geographic image boundary field containing information indicative of a real-world geographic area depicted within the image, an image file location field, and an image status field; receive a plurality of signals from one or more processing computer, at least two of the signals having the information identifying particular captured images, and second information indicative of updates indicating a change in at least one of the image location and image processing status for the image identified by the first information; and populating at least one of the image location and the image processing status of the placeholders within the geospatial database with the information indicative of updates for identified captured images.

Abstract: A system and method includes a central database storing personalized content of a user, a portal for accessing and manipulating the personalized content on the central database, and a vehicle navigation system configured to receive the personalized content from the central database and to display the personalized content on a map.

Abstract: A translation system can translate a request having multiple fields to a physical address using the fields as indexes to a multi-dimensional graph. A field or portion of a field can represent a location along an axis. When combined together, the fields can represent a point in n-space, where n is the number of axes. In some embodiments, a nearest neighbor calculation can be sufficient along an axis. Therefore, a point in n-space defined by the fields can be translated along an axis until a nearest neighbor entry is determined. When the entry is determined, the entry can be accessed to determine a correct response to the translation request.

Abstract: Various embodiments herein include one or more of systems, methods, and software providing augmenting middleware communication services. Embodiments generally include services executable to provide communication capabilities between a middleware platform and an application, such as an enterprise-class application, to facilitate access to data and functionality of the application by mobile applications that access application functionality and data via the middleware platform. Some embodiments include augmenting the application with at least one service to receive a call from a middleware object requesting data and to identify data to be included in a response to the request. The identified data may then be retrieved and returned to the calling middleware object. The call of the middleware object is typically received from a mobile device application and the middleware object provides data received in response to the request to the mobile application.

Abstract: According to exemplary embodiments, a method and system for generating binary Extensible Markup Language (XML) data is provided. The generating includes acquiring an XML data source and generating a first child distance (FCD) token and a next sibling distance (NSD) token of an element node in the XML data source. The generating also includes generating binary XML data of the XML data source by using the FCD token and the NSD token, where the binary XML data includes the FCD token and the NSD token.

Abstract: A method and apparatus for routing an event to a human interface object in a computer system. A routing type is assigned to each event type which may be received. The event is received and the routing type assigned to the event is determined. The event is then routed based on the routing type. In embodiments of the invention, the routing type may be geometric, focus, or broadcast, but is extensible. The routing types may be added or removed from a list of routing types, at request of processes.

Abstract: Exemplary methods and apparatuses are provided which may be implemented using one or more computing devices to allow for super clustering of clusters of electronic documents based, at least in part, on structural and static content features.

Abstract: Systems, methods, and computer program products are provided for managing a playlist on a portable media device including generating a random order of media items based on a seed, receiving an instruction to power down the portable media device, saving the seed in a storage, and powering down the portable media device.

Abstract: A distributed object store in a network storage system uses location-independent global object identifiers (IDs) for stored data objects. The global object ID enables a data object to be seamlessly moved from one location to another without affecting clients of the storage system, i.e., “transparent migration”. The global object ID can be part of a multilevel object handle, which also can include a location ID indicating the specific location at which the data object is stored, and a policy ID identifying a set of data management policies associated with the data object. The policy ID may be associated with the data object by a client of the storage system, for example when the client creates the object, thus allowing “inline” policy management. An object location subsystem (OLS) can be used to locate an object when a client request does not contain a valid location ID for the object.

Abstract: A solution is introduced to generate structured program language bindings for system interfaces in various kinds of programming languages, which provides a higher level semantic view for system integration. The primary goal of the language bindings is to present a view of the system interfaces as Java objects rather than message building primitives. Consequently, a system developer or integration programmer can focus on functions of the interfaces required for the integration and no longer have to deal with the construction and processing of messages of the interfaces.

Abstract: A computer-implemented method for search engine synchronization is disclosed according to an aspect of the subject technology. The method comprises receiving, at a computing device, a search engine entry for a search engine, wherein the search engine entry comprises a keyword for invoking the search engine, and a globally unique identifier (GUID) uniquely identifying the search engine. The method also comprises determining whether there is a local search engine entry stored locally on the computing device with the same GUID as the received search engine entry, and, if there is a local search engine entry with the same GUID as the received search engine entry, then performing steps. The steps comprise determining whether the received search engine entry is newer than the local search engine entry, and, if the received search engine entry is newer, then replacing the local search engine entry with the received search engine entry.

Abstract: Methods and apparatus for information organization and exchange by providing a data store of interconnected items of information that together form an intent-driven taxonomy. This allows users to easily discover and exchange real-time items of information across applications.

Abstract: A system and method that enables promotion of data from within a structured data file to a library is described. This system and method can also enable demotion of data from a library to within a structured data file. Further, this system and method can copy data from a structured data file, perform a function on the copied data, and promote a result of the performed function to a library.

Abstract: A method for populating a data system is provided. The method includes the step of mapping at least one application path of the data system to at least one conceptual path of an ontology system. The application path addresses parts of the structure of the data system, and the conceptual path addresses parts of the structure of the ontology system. The method further includes the step of automatically populating the data system at a location addressed by the application path with data values contained in the conceptual path.

Abstract: Encoding and/or decoding of messages. On the encoding end, a composite encoder encodes message from an internal format that is used by internal system components into an external format. However, the composite encoder may encode the outgoing messages into different external formats on a per-message basis. For incoming message, a composite decoder decodes incoming messages from any one of a plurality of external formats into the internal format also on a per-message basis. A per-message report mechanism permits internal system components and the encoding/decoding components to communicate information regarding the encoding or decoding on a per message basis. XML messages can be converted automatically into Binary messages.

Abstract: Methods, computer systems, and physical computer storage medium for organizing data are provided. A method includes monitoring usage of the data, detecting a pattern in the usage of the data, and assigning a first concrete implementation associated with a first data structure to the data, based, in part, on the detected pattern of usage of the data. The method also includes identifying a change in the pattern of usage of the data, after the step of assigning and switching the first concrete implementation associated with the first data structure to a second concrete implementation, based, in part, on the change in the pattern of usage.

Abstract: A method for processing a data object for a database, the database containing data representing a first data model and a set of one or more mapping rules, includes receiving a data object that conforms to a second data model. The method then selects one or more of the mapping rules. The mapping rules provide a mapping between a set of elements of the second data model and a corresponding set of elements of the first data model. The method applies the selected mapping rules to transform a set of elements of the received data object into a corresponding set of elements of a target data object conforming to the first data model. The method then searches the database for the set of elements of the target data object to identify instances of the target data object in the database. A corresponding computer program product and apparatus are also disclosed.

Abstract: A method for processing a data object for a database, the database containing data representing a first data model and a set of one or more mapping rules, includes receiving a data object that conforms to a second data model. The method then selects one or more of the mapping rules. The mapping rules provide a mapping between a set of elements of the second data model and a corresponding set of elements of the first data model. The method applies the selected mapping rules to transform a set of elements of the received data object into a corresponding set of elements of a target data object conforming to the first data model. The method then searches the database for the set of elements of the target data object to identify instances of the target data object in the database. A corresponding computer program product and apparatus are also disclosed.

Abstract: There is provided a system and method for real-time media presentation using metadata clips. There is provided a media device for providing one or more media files for a display, the media device including a memory and a processor. The memory includes a plurality of metadata clips, wherein each of the plurality of metadata clips references a referenced source media from the media files, a referenced start position, and a referenced end position. The processor can determine a playlist including some of the plurality of metadata clips for streaming segments of media files as defined by their referenced start and end positions. Flexible behaviors can also be added to enhance playback logic or to enforce access restrictions, and metadata clips and playlists may also be user generated.

Abstract: Creating and executing a distributed stream processing operator graph based on a query. The operator graph includes movable stream algebra operators for processing events received from high volume data streams. The operators are partially compiled and distributed to computing devices for completion of the compilation and subsequent execution. During execution, the operators maintain minimal state information associated with received events via an expiration time assigned to each of the event instances. Additional events are generated and aggregated by the operators for communication to a service responsible for the query.

Abstract: A method and system for retrieving and normalizing product information are described. The system retrieves product information from sources that are accessed over a network. Next, the system creates markup language based on the product information. The markup language includes a first attribute-value pair that includes a first attribute and a first value. Next, the system normalizes the markup language by translating the first attribute to a second attribute responsive to an identification of the first attribute in a list that includes a plurality of attributes that are associated with a first product and the second attribute. The second attribute is a canonical representation of the plurality of attributes respectively.

Abstract: A computer readable storage medium includes executable instructions to evaluate an expanded shared-nothing data store configuration. A data redistribution schedule table with specified parameters is formed. Data is redistributed within the expanded shared-nothing data store in accordance with the data redistribution schedule table.

Abstract: Embodiments of the present invention relate to an approach for reusing information/knowledge. Specifically, embodiments of the present invention provide an approach for retrieving previously stored data to satisfy queries (e.g., jobs/tickets) for solutions to problems while maintaining privacy/security of the data as well as ensuring the quality of the results. In a typical embodiment, a query for a solution to a problem is received and details are extracted therefrom. Using the details, a search is performed on a set of data stored in at least one computer storage device. Based on the search, a set of results will be generated and classified into a set of categories. In any event, the quality of each of the set of results will be assessed based on the usefulness of the set of results.

Abstract: The present description relates to a computer-implemented method, computer system, and computer program product for optimization of evaluation of a policy specification. In one aspect, the computer-implemented method for optimization of evaluation of a policy specification may comprise receiving the policy specification represented as a tree, the tree comprising a plurality of nodes. A visiting history of the tree may be determined by computing a density at least for each node in a subset of the plurality of nodes having been visited. The density may be determined by a relationship between a position of a node v in the tree and a frequency F(v) in which the node v is visited. The tree may be transformed with respect to the visiting history into a similar tree such that sibling nodes in the subset of the plurality of nodes are sorted in decreasing order according to their density.

Abstract: Systems and methods for automating and increasing the efficiency of access to data using inheritance of access rules within an organization based upon the relationship of positions within the organization and the roles associated with the positions. In one embodiment, a role structure is used in conjunction with a hierarchical organization structure to allow access rules to be inherited by some of the positions from other positions based upon the relationship of positions within the organization and the roles associated with the positions. Access rules can be applied across equivalent or similar positions, yet differentiated between distinct portions of the organization and the distinct roles associated with the positions. Consequently, particular access rules are not necessarily inherited by all of the positions subordinate to a particular position with which the rule originates, and are not necessarily inherited by all of the positions that are associated with a particular role.

Abstract: Non-destructive data storage is disclosed. An information change is stored that is associated with a business object such that tracking of the information change is enabled with respect to one a transaction time and/or an effective time. The stored information change is accessed with respect to a time.

Abstract: A method for operating a computer data storage system is described. A plurality of requests are received from a client, each request of the plurality of requests having assigned a unique sequence number, each request being an input/output request to a data storage device. The plurality of requests is divided into a plurality of subsets of requests. A unique batch number is assigned to each subset of requests so that each subset of requests is assigned a unique batch number. A first subset of requests having a first batch number is executed in arbitrary order with respect to the sequence number of each request. A second subset of requests is executed in response to a second batch number after execution of all of the first subset of requests has completed.