Abstract: A method and system for identifying nodes with similar content. In one aspect, the method comprises determining a structure of a network of nodes, said structure defined by incoming links and outgoing links between nodes within said network, grouping said nodes within said network into a first set of modules, calculating a first modularity value between each of the modules within the first set, said modularity value indicating a degree of similar content within each module, calculating a topical relevance value for each of the modules, selecting those modules whose topical relevance value exceeds a threshold value and calculating an authority score for the selected modules.

Abstract: To realize a high speed merge sort method by applying a coupled node tree, which method extracts a smallest or largest key from a plurality of sorted key storage areas in each of which is stored keys including bit strings that are sorted, and generates a coupled node tree for merge while adding a processing source identifier that identifies the sorted storage area wherefrom the key has been extracted, and repeats the actions of writing out into the merged key storage area a key being obtained by a minimum or maximum value search on the coupled node tree and deleting the key, and inserting into the coupled node tree a key by extracting the key from one of the plurality of sorted key storage areas.

Abstract: A flow based detection system for detecting networks attacks on data networks. Flow records are collected in a novel data structure that facilitates efficient sorting. The sorted data structure can be subsequently analyzed in an efficient manner to find out if the network is under attack. An attack is identified if the numbers of unique corresponding addresses or conversations are too large.

Abstract: Described herein is a technology that facilitates efficient large-scale similarity-based retrieval. In several embodiments documents, images, and/or other multimedia files are compactly represented and efficiently indexed to enable robust search using a long-query in a large-scale corpus. As described herein, these techniques include performing decomposition of a file, e.g., a document or document-like representation. The techniques use dimension reduction to obtain three parts, topic-related words (major semantics), document specific words (minor semantics), and background words, representing the major semantics in a feature vector and the minor semantics as keywords. Using the techniques described, file vectors are matched in a topic model and the results ranked based on the keywords.

Abstract: A method and system for presenting a dataset with context-sensitive pagination are described. The dataset is sorted and divided into subsets according to a first attribute, and the subsets are presented via a user interface, which contains a navigation control relating to the first attribute. When the dataset is sorted and divided according to a second attribute, the navigation control dynamically updates to relate to the second attribute. This allows a user to navigate pages of data in a manner consistent with chosen sorting criteria.

Abstract: A method and apparatus for optimizing a de-duplication rate for backup streams is described. In one embodiment, the method for optimizing data de-duplication using an extent mapping of a backup stream includes processing a backup stream to access an extent mapping associated with a plurality of data files, wherein the plurality of the data files are arranged within the backup stream and examining the extent mapping to identify at least one extent group within the backup stream, wherein the plurality of the data files are de-duplicated using at least one location of the at least one extent group.

Abstract: Provided is a method for displaying information such as lists of data, files and icons in a window of a graphical user interface (GUI). Unlike a typical display methodology, which arranges items in a “machine-dependent” sorting order, the disclosed technology provides a “natural” sorting order. The list, or names associated with the files or icons are incorporated into a query and the query is transmitted to a web service. The web service parses the query to determine a natural order appropriate to the material represented by the list, files, or icons rearranges the list, files or icons into the natural order and returns a response to the originator of the query. The operating system or GUI that originated the query receives the response, parses the response and displays the list, files or icons in the corresponding natural order.

Abstract: Computer programs encoded on a computer storage medium provide for a modular query optimizer. In one aspect, a computer program product includes selecting one or more projections from a set of projections for each table in a database query wherein each of the selected projections for the table has leads to an estimated lower execution cost for the query as compared to non-selected projections; generating join orders for the query based on data distribution of one or more of the selected projections among sites in a computer network wherein the join orders reflect different combinations of data distribution operations applied to the output of one or more of the query's joins; and selecting a join order from the join orders based on evaluation of the join orders using a cost model.

Abstract: A search engine system is described herein that provides an alternative data path for collecting results provided by index servers. The alternative data path collects the results in a direct and asynchronous manner; this is in contrast to a synchronous path used to deliver search results to end users via one or more aggregator modules. An analysis system can use the alternative data path to collect a large amount of richly descriptive information regarding the performance of the search engine system, circumventing bottlenecks and other constraints that would otherwise be imposed by the synchronous data path. The analysis system can analyze the information collected from the index servers to improve the performance of the search engine system.

Abstract: A markup language schema utilized to represent internal ranking models. In one implementation, the schema developed utilizes XML (extensible markup language) for internal ranking model representation. Other markups languages can be employed.

Abstract: Methods and systems for identification of paraphrases from an index of information items and associated sentence fragments are described. One method described comprises identifying a pair of sentence fragments each having a same associated information item from an index, wherein the index comprises a plurality of information items and associated sentence fragments, and identifying a paraphrase pair from the pair of sentence fragments.

Abstract: Methods, systems, and apparatuses, including computer programs encoded on computer readable media, for generating Venn-like diagram illustrating cross channel conversion paths. In one aspect, a plurality of conversion paths are received. Each conversion path includes one or more user interactions that include a plurality of dimensional data. A sorted list of channel groups that includes one or more group rules is received and each user interaction is grouped into a channel based upon the channel groups. A selection of channels to visualize is received and an image including one circle for each selected channel is generated. The circles are optimally placed to maximize the accuracy of the overlapped regions with channel group data.

Abstract: The present invention relates to a method of creating indexes so that an index scan can be worked for columns in a database encrypted by means of secrete key cipher algorithm. The method of creating indexes according to the present invention comprises the steps of: re-encrypting to be able to maintain the sort ordering based on a plain text; creating new indexes based on the re-encrypted data; and configuring domain index architecture of encrypted columns so that the created index is used for the index scan in a query statement.

Abstract: Methods and systems for identification of paraphrases from an index of information items and associated sentence fragments are described. One method described comprises identifying a pair of sentence fragments each having a same associated information item from an index, wherein the index comprises a plurality of information items and associated sentence fragments, and identifying a paraphrase pair from the pair of sentence fragments.

Abstract: A social network service provides trusted, timely and managed communications between a querying individual and an informed individual by optimizing distribution of queries to reflect a requisite amount of expertise necessary (i.e., interest, background, education, demographic attribute, etc.). Those candidate recipients with a rare level of expertise or specialization can specify a desired level of participation, which is respected. In order not to exhaust their availability, those who are less qualified or part of a larger demographic category appropriate for the query are selected to handle queries of lesser difficulty or less specialization. Anonymity if desired by the recipient party can be supported by increasing the pool of candidate recipients so that the querying party cannot reasonably ascertain who is responding. Timeliness of response, as well as satisfaction in the response, is tracked in order to affect redirection of a query.

Abstract: Disclosed are a method, system and computer program product for sorting records based on content in a free text field. A request is received by a sort function to sort a free text field. The sort function request is intercepted. The content in the free text field is analyzed. One or more new focus words are identified by the analysis. The new focus words are used to sort the free text field. The focus words in the free text field are highlighted and sorted alphabetically. Sorted free text field results based on the new focus words are displayed to a user on the user's display.

Abstract: Technologies are generally described for methods, instructions, and client applications for device discovery in a ubiquitous computing environment. In some examples, the methods, instructions, and client applications may facilitate the organization of features of devices in a ubiquitous computing environment into a series of hierarchical hash numbers, the ordering of the hierarchical hash numbers corresponding to the respective devices, and the searching for a particular one of the devices by attempting to match hashed search criteria to the ordered hierarchical hash numbers at one of the devices in the ubiquitous computing environment.

Abstract: A result shaping methodology is part of a bridge (translation layer) between an entity provider and an underlying store provider. The bridge accepts command trees and parameter values from a consumer (e.g., the entity provider), reshapes the trees as necessary for its underlying store provider to execute, executes resulting commands, and assembles the results from the commands into the nested data reader that the initial command tree requested. The result assembly advantageously takes a mapping declaration and compiles it into a set of expression definitions composed from a small number of simple functions. Each collection in the result has a corresponding expression describing how collection elements are realized given relational results. Other expressions describe boundary detection behavior. These expressions are compiled into functions used to shape relational data into arbitrary object graphs or streaming interfaces.

Abstract: A data processing apparatus and a method for displaying time-based data are provided. The data processing apparatus includes a storage unit for storing data processed by the data processing apparatus and identification information for sorting the data, a display unit having a first display section for displaying one or more data sort functions and a second display section for displaying data according to a data sort function selected from the first display section, and a control unit for sorting the data stored in the storage unit and controlling the display unit to display the data in a life data mode.

Abstract: Techniques are described herein for providing protocol extensions to the WS-Enumeration protocol. A selection protocol extension to the WS-Enumeration protocol enables retrieval of partial representations of objects from a directory server. The partial representations include attributes of the objects that are designated via the selection protocol extension. A sorting protocol extension to the WS-Enumeration protocol enables sorting of objects (or partial representations thereof) to be retrieved from a directory server. The selection and sorting protocol extensions are defined in respective XML elements that are distinct from an XML element that defines an object request including a query filter for selecting objects in the directory server. The selection and sorting protocol extensions may be used independently from each other. The computer languages utilized by the aforementioned XML elements need not necessarily be the same. For instance, a different computer language may be used for each.

Abstract: The present invention relates to a computerized method and systems for managing feeds so that a user's playlists may be automatically updated in accordance with a user's desired media preferences.

Abstract: Technologies are described herein for providing a more efficient approach to ranking search results. One method reduces an amount of ranking data analyzed at query time. In the method, a term is selected, at index time, from a master index. The term corresponds to a number of documents greater than a threshold. A set of documents that includes the term is selected based on the master index. A rank is determined for each document in the set of documents that contains the term. Each document in the set of documents that contains the term is assigned to a high ranking index or a low ranking index based on the simple rank.

Abstract: A system and method to sort attachments in an integrated information management application. The system includes an email agent, and email repository, and an attachment engine. The email agent facilitates organization of email communications within the integrated information management application. The email repository is coupled to the email agent. The email repository stores a plurality of email files and a plurality of email attachments. The email attachments are associated with at least some of the email files. The attachment engine is coupled to the email agent. The attachment engine generates a list of the email attachments within the email repository for visual communication on a display device.

Abstract: A system and method for defining a segment for filtering website visitation data is disclosed. The method allows for creation and editing of a segment using various rules. The rules are defined using events and containers, which act as criteria by which the data is filtered. The system displays the segments and allows the user to apply them to stored data.

Abstract: A computer-implemented method for positioning targeted sponsored content on a cellular phone includes the steps of (a) assessing a likelihood of an interaction by a user of the cellular phone with a sponsored content, wherein the assessment is based on a plurality of user characteristics associated with the cellular phone, such as a user profile and a predefined hardware/software characteristic; (b) prioritizing the placement of the sponsored content within one of a plurality of predefined areas of a graphical user interface of the cellular phone over the placement of other sponsored content within the same area, wherein the prioritization is based on the assessment of the likelihood of the interaction of the user of the cellular phone with the sponsored content; and (c) presenting the sponsored content within the one of a plurality of predefined areas of the graphical user interface of the cellular phone.

Abstract: The present technology is directed to improving the conversion rate of invitational content that is provided to the user of an interactive, content-receiving-and-displaying device. The content of a large number of primary-content sources is analyzed and keyword and/or other context-providing information is extracted from the primary-content sources. The keyword and/or other context-providing information is used to index the primary-content sources into an index according to a hierarchical taxonomy; the hierarchical taxonometric index is used to identify primary-content sources with which a given item of invitational content correlates; and the given item of invitational content is delivered to a user in response to the user accessing a primary-content source with which the given item of invitational content correlates.

Abstract: A method of organizing episodic content includes identifying a list of items associated with episodic content and sorting the list of items based on at least episode order upon a prompt.

Abstract: Systems, program product, and methods of data management are provided. The system can include a computer having memory, a dataset including a relatively large number of records, and container approximation indexing program product stored in the memory of the computer and adapted to cause the computer to sort the dataset of records by key field values into a finite number of data containers being less than or equal to a maximum number of file descriptors permitted to be simultaneously opened.

Abstract: Disclosed are methods and systems for automatically assigning index terms to electronic documents such as Web pages or sites in a manner which may be used to facilitate the retrieval of electronic documents of interest. The method involves determining co-occurrences of terms in other documents with the electronic document, and selecting terms as index terms based upon those scores. The method permits the efficient retrieval of electronic documents.

Abstract: The architecture implements A-buffer in hardware by extending hardware to efficiently store a variable amount of data for each pixel. In operation, a prepass is performed to generate the counts of the fragments per pixel in a count buffer, followed by a prefix sum pass on the generated count buffer to calculate locations in a fragment buffer in which to store all the fragments linearly. An index is generated for a given pixel in the prefix sum pass and stored in a location buffer. Access to the pixel fragments is then accomplished using the index. Linear storage of the data allows for a fast rendering pass that stores all the fragments to a memory buffer without needing to look at the contents of the fragments. This is then followed by a resolve pass on the fragment buffer to generate the final image.

Abstract: A method includes submitting a query to multiple search engines. The method also includes receiving a ranked list of search results from each search engine based on the query. The method includes determining a search engine weighting value for each search engine, where each search engine weighting value indicates a degree of relevance of a category of specialization of a particular search engine to a category of the query.

Abstract: A method of generating a TrafficRank index for a network search engine is described. The method includes monitoring network traffic through a network device. The method further uses the monitored traffic information to generate and maintain a TrafficRank index. The invention extends to a method of generating search results, including generating search results from a search engine index and ranking the search results based on the TrafficRank index. The invention also extends to a method of generating and updating a search engine index either in real-time or in batch mode. If the method is adopted, any website or URLs accessed through website monitor/notifier/updater module by a web user, either by clicking on a hypertext link, entering the URL address on a web browser, or selecting a bookmark on a web browser, would be included and updated in the search engine index.

Abstract: A mechanism for performing a sorted search in a distributed directory environment using a proxy server. A sorted search request for a set of top entries is sent to each backend server. The proxy server identifies a target server which returned a top entry in the set and sends another sorted search request to the target server for all entries having a sort order higher than or equal to the top entry and a sort order lower than or equal to the next top entry of the set, and returns the entries to a requesting client. The proxy server sends another sorted search request to the target server for a new top entry having a sort order greater than the next top entry and adds the new top entry to the set. The proxy server returns to the evaluating step until no top entries remain in the set.

Abstract: A method and system is provided that optimizes performance in non-relational databases. According to one aspect, view index size is kept at a level that optimizes performance by categorizing and sorting only a subset of the columns contained within the corresponding view. The remaining columns are marked as having been categorized and sorted, but are not actually categorized and sorted until these columns are queried.

Abstract: An improved system and method for classifying tags of content using a hyperlinked corpus of classified web pages is provided. An anchor text index may be searched to find anchor texts that may match text of the tag, documents referenced by the matching anchor texts may be found, and the documents referenced by the matching anchor texts may be grouped to disambiguate multiple classifications that result from matching the anchor texts with the categories of the reference documents. To resolve ambiguity between multiple classifications, weighted classifications may be used where each document may be assigned a positive weight for a mapping to a category to indicate the confidence of the classification of the document to the category. The classification for the grouping of the documents referenced by the matching anchor texts with greatest frequency may be selected and output as the classification for the tag.

Abstract: The sort processing of keys to be sorted, which keys are expressed as bit strings involves a classification processing. In the classification processing, a bit string comparison between a reference key and a key which is an object of the classification is performed, and a difference bit position is obtained that is the bit position of the first bit that differs in the bit string comparison and the keys to be sorted are classified by the difference bit position into key groups with the same difference bit position.

Abstract: According to the web site search and selection method, in response to a search query a relevance score is assigned to each page of the web sites addressed by the search engine. Then, for each web site addressed by the search engine, the relevance scores of the individual pages are added together, after weighting them by a correction factor indicative at least of the number of pages of the site itself. In this manner, in response to the search query an overall relevance value for the sites addressed by the search engine is obtained.

Abstract: In an example embodiment, a method is illustrated to determine multi-column indexes, the method including receiving one or more structured query language (SQL) queries, the one or more SQL queries defining a workload. A database index analysis tool may be used to determine a plurality of index configurations for executing the workload. Further, leading index configurations may be determined, leading index configurations including a subset of the plurality of index configurations. Also, a statistics database may be updated with complete statistics for the leading index configurations.

Abstract: A computer program product and computer system for in-place sorting sequences of binary bits stored contiguously in an array within a memory device of the computer system prior to sorting. Each sequence includes contiguous fields of bits. The algorithm is executed by a processor of the computer system. The in-place sorting executes program code at each node of a linked execution structure. Each node includes a segment of the array. The program code is executed in a hierarchical sequence with respect to the nodes. Executing program code at each node includes: dividing the segment of the node into groups of sequences based on a mask field having a mask width, wherein each group has a unique mask value of the mask field; and in-place rearranging the sequences in the segment, wherein the rearranging results in each group including only those sequences having the unique mask value of the group.

Abstract: A system for sharing files among different virtual machine images includes a processor, a memory, and an input/output subsystem. The processor is configured for: a) creating a first virtual image; b) determining whether there exists a second virtual image similar to the first virtual image; c) comparing the files of the first and second virtual images to determine a set of common files; d) creating a common file collection; f) creating a second version of the first virtual image with files in the first virtual image that are not in the common file collection; g) creating a second version of the second virtual image with files in the second virtual image that are not in the common file collection; h) receiving a request for modification of the file within one of the virtual images; and i) determining whether the file to be modified is in the set of common files.

Abstract: A system and method for operating on objects stored in a distributed database is provided. Rows of a distributed database that correspond to an index are identified. The identified rows are sorted lexicographically based on row names of the identified rows. The sorted rows are ordered by priorities of objects corresponding to the sorted rows. The objects corresponding to the sorted rows are operated on in priority order. In some embodiments, the objects are replication requests for replicating data in a distributed storage system, and operating on the objects corresponding to the sorted rows in priority order includes executing the replication requests in priority order to replicate data in the distributed storage system.

Abstract: Control statements related to inputting, sorting, filtering, formatting, and outputting data records in a data processing system are scanned to find one or more formatting options related to character translation. Files comprising a plurality of data records are input, processed, and output as directed by the control statements. As specified by the formatting options, character translation operations are conducted on selected characters. The character translation operations are conducted in conjunction with inputting and outputting the data records. In one embodiment, the supported character translation operations include lowercase to uppercase conversion, uppercase to lowercase conversion, EBCDIC-to-ASCII conversion, ASCII-to-EBCDIC conversion, and user-definable character translation. The present invention increases the utility of a data processing system while minimizing the programming burden associated with translating selected characters while processing data records.

Abstract: A content management system having a repository of information organized according to an index file, a method of importing unstructured content comprising an XML or other template of configurable import rules to enable retrieval of information components of the unstructured content; ascertaining at least one structural attribute of the unstructured content; enabling a user to configure import rules according to the ascertained structural attribute(s); accessing and examining information components of the unstructured content according to the attribute(s); optionally tagging information components of the unstructured content according to a value of the accessed and examined information components; importing information components of the unstructured content into a repository of the content management system according to indices of the index file; identifying a workflow task with respect to the information components of the imported content; and processing a workflow task of the content management system relati

Abstract: A method and apparatus is disclosed herein for synchronizing distributed work. In one embodiment, the method comprises receiving first and second metadata entries, adding the first and second metadata entries to a set corresponding to a digital object, and providing access to first and second unique identifiers used for referencing the first and second metadata entries respectively, where the first and second unique identifiers are based on contents of the first and second metadata entries respectively.

Abstract: Information related to telephone numbers is efficiently stored and retrieved by generating an index based on a portion of a telephone number for which information is to be stored or retrieved. For example, the portion of the telephone number can be a prefix of the telephone number. Information related to the telephone number is stored and retrieved in accordance with the generated index.

Abstract: The present invention provides systems and methods for automatically mining massive intelligence databases to discover sequential patterns therein using a novel combination of forward and reverse temporal processing techniques as an enhancement to well known pattern discovery algorithms.

Abstract: A computer displays an application user interface, the application user interface including a document authoring window and a search results window. In response to a search request including one or more user-specified search keywords, the computer displays in the search results window a set of search results in a text-only display format, wherein each search result includes a chunk within a respective document that satisfies the search keywords. In response to a user request to view a chunk, the computer launches a document display window in the application user interface and displays therein a portion of the corresponding document that includes the chunk in its native display format. In response to a user request to duplicate a segment of the corresponding document in the document authoring window, the computer generates therein an instance of the segment of the corresponding document in its native display format.

Abstract: A method and system are provided of processing a search query entered by a user of a device having a text input interface with overloaded keys. The search query is directed at identifying an item from a set of items. Each of the items has a name including one or more words. The system receives from the user an ambiguous search query directed at identifying a desired item. The search query comprises a prefix substring of at least one word in the name of the desired item. The system dynamically identifies a group of one or more items from the set of items having one or more words in the names thereof matching the search query as the user enters each character of the search query. They system also orders the one or more items of the group in accordance with given criteria.

Abstract: Methods and systems for identification of paraphrases from an index of information items and associated sentence fragments are described. One method described comprises identifying a pair of sentence fragments each having a same associated information item from an index, wherein the index comprises a plurality of information items and associated sentence fragments, and identifying a paraphrase pair from the pair of sentence fragments.

Abstract: A database is created from a set of data by identifying the patterns in the data set, storing the patterns in a memory device, and generating a representation of the database structure using pointers to the stored patterns. The use of pointers to store the patterns can greatly reduce the amount of memory or other space required to store the data set by replacing duplicate patterns with additional pointers, which are normally considerably smaller in size. In addition, the use of pointers may allow for more rapid searching, sorting, and other operations on the database. The representation of the database may use pointers in a tree structure to identify nodes and reduce searching and other operations. A tree structure representation of a table may use a pointer to a pattern for the base leaf node (e.g., nodes that do not branch) while using pointer pairs to represent branching nodes.