Abstract: The present invention discloses methods, systems, and tools for evaluating a number of value significance measures of ontological subjects of compositions or networks. The method breaks a composition into its constituent ontological subjects of different orders and builds a participation matrix indicating the participation of ontological subjects of the composition in other ontological subjects, i.e. the partitions, of the composition. Using the participation information of the OSs into each other, an association strength matrix is built from which the value significance measures of the partitions of the composition are calculated. The methods systematically calculate the value significances of the ontological subjects of different orders of the composition. Various systems for implementing the methods and some exemplary applications and services are disclosed.

Abstract: A request for an entry of a dictionary having multiple dictionary blocks may be received, where the dictionary stores string values associated with corresponding value identifiers (IDs) for dictionary compression. One of the dictionary blocks may be selectively loaded into memory, and the dictionary block that has been loaded into memory may be searched. A value ID directory may be constructed in memory, where the value ID directory includes last value IDs for the dictionary blocks, and each of the last value IDs is mapped to an index of one of the dictionary blocks that includes a string value for that last value ID. A separator directory may also be constructed in memory, where the separator directory includes separators for the dictionary blocks, and each of the separators is mapped to an index of one of the dictionary blocks that includes a string value for that separator.

Abstract: A system for document retrieval in a network environment is provided where documents are stored with corresponding privacy codes. A query server computer is in communication with the network and is programmed to generate a privacy index of all documents available on the network indexed by their corresponding privacy codes. The privacy codes define document access permissions that are securely associated with the documents and are assigned by document custodians. A search engine in communication with the network is configured to receive a query from a requester and generate a list of documents from the privacy index which match search parameters of the query and privacy codes of the requester.

Abstract: A method for managing information about a product. A processor searches documents for a location of a message of the product using a set of rules that are based on instructions for generating the message. The instructions are in a resource of the product. The processor then adds the location to an index of locations of the message in the documents.

Abstract: Techniques for handling large string values in a string dictionary within an in-memory database system are presented. The string dictionary can be a paged-column main dictionary. For example, a value block of a dictionary may be loaded into memory, where the dictionary stores values for dictionary compression. The value block may include a first portion of a large string value and one or more logical pointers to one or more large string pages containing a remainder of the large string value. The large string value may be materialized into a contiguous location in memory, and a pointer to the materialized large string value may be created.

Abstract: A computer-implemented data processing method comprises receiving information from a user computer concerning a desired output to be generated, adding the information concerning the desired output to be generated to a data structure, and adding additional information to the data structure concerning intermediate outputs to be generated. The information concerning the desired output to be generated is received at a host computer. The host computer is one of a plurality of host computers configured to collect and analyze data received from a plurality of source computers. The data structure represents a list of outputs to be generated by the plurality of host computers. The intermediate outputs are precursor inputs needed to generate the desired output. The additional information is added to the data structure based on the information received from the user computer and based on stored information.

Abstract: An embodiment of a method includes receiving a selection of an original content item, deriving a supplemental content item from the original content item, designating a unique identifier to the supplemental content item, and inserting a reference including the unique identifier into the primary document. A system includes a candidate content item repository having one or more content items that can be included in a structured electronic document, a copy module configured to derive a base supplemental content item from a selected one of the candidate content items and further configured to designate a unique identifier for the base supplemental content item, and a document editor configured to receive the unique identifier and insert the unique identifier into a reference to the base supplemental content in the primary document.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for storing, in an index associated with a document, a particular term that occurs in the document, wherein the particular term comprises n words, and wherein n is greater than 1; identifying a substitute term of the particular term; and in response to identifying the substitute term of the particular term, storing, in the index associated with the document, (i) the substitute term of the particular term, and (ii) data indicating that the substitute term spans the n words of the particular term.

Abstract: A computer-implemented method of providing unique identification information for an element in a tree data structure where the element does not have an independent, unique identifier associated therewith by which it can be identified without reference to any further element. The method comprises determining (130) identification information uniquely identifying an element in a structure model, by reference to another element in the structure having a unique identifier associated therewith by which the other element can be uniquely identified without reference to any further element in the structure. The unique identification information comprises a unique identifier of the other element by which said other element can be uniquely identified in the structure without reference to any further element in the structure, and path information uniquely identifying the element in the structure relative to the other element.

Abstract: Methods and apparatus for data distribution and concurrence are provided. Data and a primary key of the data are obtained. A sub-key is assigned according to the primary key. The data are routed to a corresponding queue according to the sub-key. A writing operation is processed to the data in the queue. Because multiple sub-keys can exist under a same primary key and each sub-key can have one place for the writing operation, the writing operation can be processed simultaneously to the multiple sub-keys without affecting one another. The success rate of data writing concurrence can be improved and timeliness of the data can be ensured.

Abstract: Hierarchical data objects are indexed using an index referred to herein as a hierarchy-value index. A hierarchy-value index has, as index keys, tokens (tag name, a word in node string value) that are extracted from hierarchical data objects. Each token is mapped to the locations that correspond to the data for the token in hierarchical data objects. A token can represent a non-leaf node, such as an XML element or a JSON field. A location can be a region covering and subsuming child nodes. For a token that represents a non-leaf node, a location to which the token is mapped contains the location of any token corresponding to a descendant node of the non-leaf node. Thus, token containment based on the locations of tokens within a hierarchical data object may be used to determine containment relationships between nodes in a hierarchical data object.

Abstract: A system for indexing physical objects, locations and people, collectively referred to as video objects, which appear in videos. The system enables video object-level identification of TV and video content, and makes those video objects indexable, linkable, and searchable.

Abstract: Disclosed is a service which obtains media directly from users and from online sources, which obtains events and anniversaries from online sources, which obtains location and date information associated with photographs, which dynamically provides users with a selection of automatically curated collections of photographs based on the then-current location of the user, based on and relevant to personal and publicly recognized anniversaries and holidays (with dates obtained directly from the users and from online sources), based on specific people or locations associated with dates, events, and anniversaries, and which presents intelligently organized location-based collections which can be quickly re-organized by a user.

Abstract: Disclosed are systems, apparatus, methods, and computer readable media for presenting updates to associated records to publish on an information feed in an on-demand database service environment. In one embodiment, data is received at a computing device configured to provide computing services via a network. The data may be separated into a plurality of data entries to define structured data. Each data entry may have a plurality of data fields. Each data field may be capable of being assigned a respective data value. The structured data may be stored in a database in an on-demand computing services environment. References to the structured data may be capable of being stored as feed items in one or more feed tables in a database. The feed items may be capable of being published in an information feed displayed on a display device.

Abstract: A method for indexing a plurality of structures, which are derived from a plurality of externalizations of users' mental models, is provided. The method comprises receiving at least one of the plurality of structures; analyzing the at least one structure according to a predetermined principle of normalization to obtain a plurality of index analysis results in a form of a plurality of tuples comprising a plurality of elements and/or a plurality of relations thereof related to the plurality of structures; and generating an index store according to the index analysis result; wherein each externalized relation indicates each externalized sequence from one of externalized elements to another one of the externalized elements; wherein each relation indicates each sequence from one of a plurality of elements to another one of the plurality of elements.

Abstract: According to an aspect, a key-value store (KVS) system includes a data management unit that stores a data KVS storing a pair of a data KVS key including information on a storage location of application data to be an access target object and the application data; and a key KVS storing a pair of an application key and the data KVS key. The data KVS includes a normal partition in which a size of a record for storing one pair is a predetermined specific size; and a special partition in which the size of the record for storing one pair is a size set according to a data size of the pair to be stored. A data relocation unit relocates a pair of a relocation target object to the special partition having the record size suitable for the data size of the pair.

Abstract: A method for in-advance obtaining properties of objects of a computerized system, the method comprising receiving a request for properties of a first object, and responsively providing the requested properties along with properties of an at least one another object that are similar to the properties of the first object, wherein the properties of the at least one another object are similar to the properties of the first object by having at least one element of properties that are common therebetween, and wherein the method is carried out by an at least one apparatus component of the computerized system, and an apparatus for performing the same.

Abstract: A method and system to provide search results via a network is described. The method may comprise receiving a search request from a user including search criteria, searching cached World Wide Web documents to obtain a web result based on the search criteria, and searching for an associated document to obtain a restricted result based on the search criteria. The associated document may be associated with the user (e.g., the user may mark or otherwise identify the document after viewing it) and access to the associated document may be restricted. The web result and the restricted result may be communicated to the user for viewing via a web browser. In an example embodiment, the user may be provided via a web interface with an option to search the World Wide Web or a database including associated documents.

Abstract: A database server receives a query associated with a calculation scenario that defines a data flow model that includes one or more calculation nodes. Each calculation node defines one or more operations to execute on the database server, the database server comprising a column-oriented database. Thereafter, the database server instantiates the calculation scenario and executes the operations defined by the calculation nodes of the instantiated calculation scenario to result in a responsive data set having a result table with a row for each column in the column-oriented database implicated by the query having a constant value. The database server then provides the data set to the application server. Related apparatus, systems, methods, and articles are also described.

Abstract: Technologies are described herein for extracting and/or calculating statistics regarding attributes present in a spreadsheet document and indexing the structural or functional attributes. A search component is also provided for receiving search queries of attributes to search an index to find spreadsheet documents having attributes that meet the search query requirements.

Abstract: Disclosed is a system and method capable of minimizing user-set search data and local filtering data by creating index data in real time. A search data processing system includes an index generation unit adapted to generate index data for a search on map-associated data of an item selected by a user; and a search execution unit adapted to execute a search operation on the map-associated data of the selected item by means of the index data.

Abstract: An information processing system including: a plurality of second information processing apparatuses connected to a first information processing apparatus via a network; and a management apparatus. The plurality of second information processing apparatuses dispersedly manage indexes established for searches using data and metadata of the data. The management apparatus includes a processor configured to monitor a search request transmitted from the first information processing apparatus, and to specify, on the basis of a monitoring result by the processor, a combination of types of the metadata, for which the processor should cause a same second information processing apparatus to manage the indexes, and the same second information processing apparatus and cause the specified same second information processing apparatus to manage the indexes of the type of the metadata of the specified combination.

Abstract: A method to design, implement and create distributed indexes for storing and comparing fingerprints of videos is presented. The method effectively utilises cloud computing platforms that offer varying amounts of computing resources. The method enables the distributed index to scale to large numbers of data points and the distributed index is robust to failures within the computing resources maintaining the index. The method minimizes the memory required to maintain the distributed index and reduces the I/O operations needed to process operations performed on the index. The method improves the efficiency of the index to process queries.

Abstract: Techniques and constructs to facilitate data management can provide improved response time and space efficiency for time-series data such as from connected devices. The constructs may enable receiving a stream of time-series data comprising a plurality of objects and a time identification associated with each of the objects. One or more tags are associated with the objects. The constructs may also chunk the stream into a plurality of contiguous chunks, each including a plurality of objects, create an index associating the time identification and the one or more tags, transmit the chunks to a first, remote storage, and then store the index.

Abstract: The design and implementation of databases within enterprises is a crucial process, but is often resource intensive and often times unnecessary as existing databases may be utilized to serve the same goals. Tracking existing databases and assessing the design specifications of proposed databases is a complex decision making process. Disclosed is a system and computer-based method for systematically controlling the approval, creation and modification of databases. The system provides a policy for enterprise governance control for database proliferation and a tool for comparing database requests to and against existing database assets.

Abstract: Examples are disclosed for searching data associated with devices in a heterogeneous data center. In some examples, data may be gathered for a database. The data may be associated with a heterogeneous data center having devices from multiple vendors. The database may be indexed to link data for a given device to an attribute, association or usage context for the given device. Responsive to a search request, data for a given device from among the devices in the heterogeneous data center may be provided based on a comparison of the search request to the indexed database. Other examples are described and claimed.

Abstract: A system and method for database storage may be dynamically optimized for entity-attribute-value (EAV) data. In one embodiment, this dynamic EAV database may include one column for the entity identification (“ID”) and a second column for the serialized data for that ID (each attribute and the values for those attributes). The database may be dynamically updated to move or copy certain attributes to a separate column. The dynamic updating of one or more attributes may be based on certain factors (seasonal, temporal, usage, etc.), such as frequent requests for a particular attribute. This dynamic updating and indexing of particular attributes may improve certain queries and data requests.

Abstract: Methods and systems allowing content owners to make their content available to broadcasters over a network or communications medium such as via the Internet.

Abstract: A method for providing data over a network using an application server having off-heap caching includes receiving at an application server coupled to a network a request for requested data, using an key index stored on the application server to locate where the requested data is stored in oil-heap memory of the application server, retrieving the requested data from the off-heap memory of the application server, and resolving the request.

Abstract: In one embodiment, a method searches a plurality of application marketplaces for applications where each application marketplace includes a plurality of applications available for download to a mobile device. The method then compares a set of applications in different marketplaces to determine certified instances of applications and uncertified instances of applications. Information is stored for the certified instances of the applications that are found in different marketplaces in a database. The method indexes the information for the certified instances of the applications in the database and stores an index based on the indexing. The index is used to provide a search result for a search query for an application.

Abstract: In one example, a method for facilitating centralized issue tracking. The method includes receiving information on a case from an issue tracking system (case information). The method facilitates executing a tagging method stored in a memory device that reads the case information, determines whether a part of the case information is desired information, and then tags the desired information. Finally, the method facilitates communicating the tagged information to a centralized database, where the centralized database stores the tagged information, and where the tagged information is accessible to the issue tracking system and at least one other issue tracking system.

Abstract: A network fingerprint manager within an automatic content recognition (ACR) system may be operable to receive one or more versions of media content associated with a network. One or more proxy content may be generated by the network fingerprint manager for each version of the received media content. The network fingerprint manager may generate a set of fingerprints from a particular one of the generated one or more proxy content for each version of the received media content. The particular one being fingerprinted may comprise proxy content with highest quality among the generated proxy content. The set of fingerprints and corresponding content ID and media time for each version of the received media content may be stored. The network fingerprint manager may generate real-time fingerprints from content in a received network feed. The network fingerprint manager may compare the generated real-time fingerprints to the stored sets of fingerprints for matching.

Abstract: A method for controlling a content in an electronic device is provided. The method includes detecting first tag information based on a content accessible by the electronic device, detecting second tag information based on an image included in the content, comparing the first tag information with the second tag information, and displaying information indicating that the content is not original on the content, when the first tag information and the second tag information do not satisfy a reference condition.

Abstract: A pervasive search architecture that indexes personal content of a querying user and made accessible to the user by other users. A compute node of a personal content location facilitates index generation and serve of the index. The index is generated for personal content stored at the personal content location. For a given content location, the index may encapsulate content stored in a set of locations with access permissions. The indexing application runs periodically at the personal content location and incrementally indexes content that is added to the shared locations. The same application allows the user to configure locations with the desired access permissions for participation in the search.

Abstract: Embodiments of the present disclosure relate to a computer system and interactive user interfaces configured to enable efficient and rapid access to multiple different data sources simultaneously, and by an unskilled user. The unskilled user may provide simple and intuitive search terms to the system, and the system may thereby automatically query multiple related data sources of different types and present results to the user. Data sources in the system may be efficiently interrelated with one another by way of a mathematical graph in which nodes represent data sources and/or portions of data sources (for example, database tables), and edges represent relationships among the data sources and/or portions of data sources. For example, edges may indicate relationships between particular rows and/or columns of various tables. The table graph enables a compact and memory efficient storage of relationships among various disparate data sources.

Abstract: A system that implements a scalable data storage service may maintain tables in a non-relational data store on behalf of clients. The system may provide a Web services interface through which service requests are received, and an API usable to request that a table be created, deleted, or described; that an item be stored, retrieved, deleted, or its attributes modified; or that a table be queried (or scanned) with filtered items and/or their attributes returned. An asynchronous workflow may be invoked to create or delete a table. Items stored in tables may be partitioned and indexed using a simple or composite primary key. The system may not impose pre-defined limits on table size, and may employ a flexible schema. The service may provide a best-effort or committed throughput model. The system may automatically scale and/or re-partition tables in response to detecting workload changes, node failures, or other conditions or anomalies.

Abstract: Embodiments are directed towards generating user isolated indexes for determining the content and relevance of relationships. User indexes may be generated that correspond to individual users of a larger population of users. Client applications may be accessed to determine items corresponding to the users. Information corresponding to the determined items may be listed in a user index corresponding to each user. Also, other information associated with the users may be stored in a data store separate from the user indexes. A context associated with one or more determined item may be determined based on an analysis of content included in the determined items, or other information. User indexes may be updated based on the determined contexts. Updating the user indexes may include updating the user index of the user associated with the determined items and updating other user indexes.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for refining search results. In one aspect, a method includes presenting search results that are responsive to a search query on a search engine results page and each search result includes a snippet. The method also include receiving a refinement to the search query through the search engine results page and generating a request to update one or more of the snippets based on the refinement. The method also includes receiving one or more updated snippets in response to the request and updating one or more of the search results presented on the search engine results page using the one or more updated snippets.

Abstract: Provided are a database (DB) managing method and system, wherein, while forming an index of a DB, a lower value and an upper value of key values of a plurality of records included in one page are stored as separators and an overlapping part of the key values is deleted from the plurality of records by using the separators to save a storage space where pages of the index is stored, and thus the performance of the DB is improved.

Abstract: A method for searching a database of digital media assets that has been indexed according to a set of general indexers. The method includes receiving a search query and defining specialized search conditions by identifying one or more elements of the search query corresponding to one or more specialized indexers. General search conditions are defined by identifying elements of the search query corresponding to the general indexers. A subset of the digital media assets are identified by applying the general search conditions, and the subset of the digital media assets is indexed using the identified specialized indexers. The subset of the digital media assets are ranked by applying the specialized search conditions.

Abstract: Techniques are provided for including collection items in the ranked set of search results that are returned to a user in response to a search query. Collection scoring techniques are also provided for generating relevance scores for collection items in a different manner than relevance scores are generated for base items that are not collections. The collection scoring techniques may be applied to non-base collection items, base collection items, or both. Items that match the search query, including base items and collection items, are ranked in a unified ranking based on their respective relevance scores, thereby allowing searches to readily determine the relevance ranking of matching collection items relative to matching base items.

Abstract: A method for searching for a travel product having one or more data elements associated therewith from a plurality of potentially suitable travel products in a system comprising a web based interface for receiving inputs from a user and from one or more sources of data, and for displaying results to a user based on the inputs; a business logic layer providing access to the sources of data in a predetermined manner, such as based on rules and preferences; and a database including data relating to the parties associated with the system; wherein the method comprises the steps of: entering one or more search parameters into the interface; launching multiple simultaneous searches based on the search criteria and one or more attribute of the travel product to the one or more sources of data to identify the potentially suitable travel products; displaying the potentially suitable travel products on the interface; selecting one or more of the potentially suitable travel products for further processing; further proces

Abstract: A computer device is configured to identify a document; determine that the document includes an annotation, the annotation describing a user interface that is to be visually displayed in connection with information identifying the document when the information identifying the document is included in a search results document, the user interface including a user interface element that, when selected, causes an action to be performed in connection with the document, and the action being performed without obtaining the document after the user interface element is selected; determine information relating to the user interface based on the annotation; and store, in a search index, the information relating to the user interface in association with the information identifying the document.

Abstract: Various embodiments for storing a logical object are provided. In one such embodiment, by way of example only, incoming data is divided corresponding to a logical data object into a plurality of independent streams, associating each data chunk of a plurality of obtained data chunks with a corresponding stream among the plurality of independent streams. At least one of the obtained data chunks and derivatives thereof is sequentially accommodated in accordance with an order the obtained chunks are received, while keeping the association with the corresponding streams. A global index is generated as a single meta-data stream accommodated in the logical data object and comprising information common to the plurality of independent streams and related to mapping between data in the logical data object and the obtained data chunks.

Abstract: A system and associated method for automatically generating a service specification of a Service Oriented Architecture (SOA) solution. A process model framework and a data model framework are received as inputs. Processes in the process model framework perform services of various complexity levels. Processes are decomposed into a respective set of atomic service processes in the lowest complexity level and data objects are extracted from the decomposed atomic service processes. The data objects are associated with data elements of the data model framework. The data model framework is extended and flexibility patterns are added for reusability of the service specification. The service specification of the SOA solution is generated as process interfaces represented with the data objects according to inputs from a user customizing aspects of the service specification, for either a desired service of the SOA solution or a desired process in the process model framework.

Abstract: Systems and methods for scheduling documents for crawling are disclosed. In some implementations, a method includes obtaining sitemap information for a plurality of websites; and analyzing the sitemap information to identify a website, in the plurality of websites. The website has sitemap information that is at least potentially out of date. The method also includes updating the sitemap information for the identified website by downloading updated sitemap information for the identified website; and scheduling documents for crawling in accordance with the updated sitemap information for the identified website.

Abstract: Techniques are described herein for routing requests for database cloud services. In an embodiment, a different Uniform Resource Identifier (URI) is assigned to each respective database schema of a plurality of database schemas in one or more databases. For each respective database schema, mapping data is stored that maps at least a portion of the URI to the respective database schema. In response to receiving a first request that includes a URI and a set of one or more database commands, a target database schema in a target database is identified based on the mapping data and the URI. A connection is established for accessing the target database schema in the target database. The set of one or more database commands is sent over the connection to access the target database schema in the target database.

Abstract: According to one embodiment of the present invention, a system selects member objects from among data objects stored in one or more data sources by evaluating criteria against information about the data objects in an index, wherein the information about the data objects in the index is derived from the data sources. The system creates a set of data objects comprising a collection of references to the selected member objects, and associates the set with a set-identifier. The system receives a request to apply an action to a subset of the data objects stored in the one or more data sources, wherein the request specifies the subset by including the set-identifier, and applies the action to the set of data objects associated with the set-identifier within the request. Embodiments of the present invention further include methods and computer program-products for managing data in substantially the same manners described above.

Abstract: A virtual table index mechanism and a method for a multi-attribute compound condition query relate to a field of computer application technology. The virtual table index mechanism for a multi-attribute compound condition query includes: an index manager; a condition analyzer; and a pre-execution engine. The present invention forms index key values corresponding to a plurality of attributes in a virtual table. When querying, a query condition for the virtual table is calculated. Referring to a key value index, whether a mapping physical table of the virtual table should be executed is independently pre judged according to the attributes, so as to ensure that query is applied only to a virtual sub-table satisfying a corresponding key value condition. The present invention is effective for multi-attribute compound condition query, and is suitable for indexing virtual tables.

Abstract: Provided are techniques that ensure efficient database accesses by partitioning. The techniques includes a partition generating unit which generates a value partition in which a unit subtree including target data to be partitioned is separated and registered according to the target data, and a base partition which includes an index for uniquely identifying the unit subtree, an XML parser which identifies positions of a start to and an end tag defining an attribute value of the structured document and generates a cutting position list Corresponding to the hierarchical structure of the attribute value for registration in a storage area, an XML cutting unit which identifies the start tag position and the end tag position of the unit subtree to be cut, and separates the unit subtree and its index from the structured document, and a cut-XML registration unit which registers the unit subtree and the index in the separate partitions.