Abstract: A database management apparatus receives the specification of an origin column, calculates a confidentiality level of a column in a different database from the database related to the origin column based on a confidentiality level of the origin column and a degree of similarity between contents of data in the origin column and contents of data in the column in the different database. A confidentiality level of the different database is calculated based on the calculated confidentiality level and a value indicating identifiability of the data in the column in the different database, and a confidentiality level of a column selected in the different database is calculated based on the confidentiality level of the different database and a value indicating identifiability of data in the selected column. The selected column is set as the new origin column, and the calculated confidentiality level is set as its confidentiality level.

Abstract: A computer-implemented method for efficiently estimating the number of unique elements in a collection of elements comprises generating, via hash logic, hash values for each element of the collection of elements. The method further comprises specifying, in a sketch-frequency table, a set of discrete statistical values associated with the hash values and, for each discrete statistical value of the set of discrete statistical values, information indicative of a frequency at which binary representations of the hash values are associated with the discrete statistical value. The cardinality of the collection of elements is estimated based on the sketch-frequency table.

Abstract: Throughput is preserved in a distributed system while maintaining concurrency by pushing a commit wait period to client commit paths and to future readers. As opposed to servers performing commit waits, the servers assign timestamps, which are used to ensure that causality is preserved. When a server executes a transaction that writes data to a distributed database, the server acquires a user-level lock, and assigns the transaction a timestamp equal to a current time plus an interval corresponding to bounds of uncertainty of clocks in the distributed system. After assigning the timestamp, the server releases the user-level lock. Any client devices, before performing a read of the written data, must wait until the assigned timestamp is in the past.

Abstract: The invention generally relates to computer-based systems to evaluate and market clinical trial research centers. In certain aspects, the invention provides computer-based systems to collect information about clinical research centers. Systems include a tangible, non-transitory memory coupled to a processor operable to retrieve, based on a user's input, an identity of a clinical research center and prompt the user for information relating generally to the center. The system can collect disease-specific information by prompting the user for a selection of a disease and then collecting from the user information identifying an ability of the center to perform one or more tests relating to the disease.

Abstract: Automatic finding of online profiles of an entity location is disclosed. Reference location data for location attributes of an entity location are obtained. A search for a profile of the entity location on a source is performed using at least some of the obtained reference location data. One or more search results are obtained. A search result includes a Uniform Resource Locator (URL) and corresponding search result location data. The search result is evaluated. Evaluating the search result includes normalizing the search result location data included with the search result and comparing the normalized search result location data against the reference location data. Based at least in part on the evaluation, it is determined whether the search result matches to a profile of the entity location on the source. In the event that the search result matches to a profile of the entity location on the source, the search result is provided as output.

Abstract: A method, computer readable medium, and computer wherein a system provides an agent device a remote connection to a server resource, obtains remote environment data from the agent device and obtains communication data exchanged between the agent device and a client device. With that data, the system provides a multidimensional monitoring unit associated with the agent device, and the monitoring unit provides access to the remote environment data from the agent device and the communication data exchanged between the agent device and the client device. The system further detects changes in the remote environment data and communication data associated with the remote agent, and issues alarms in response to detecting changes.

Abstract: A computer-implemented method for efficiently estimating the number of unique elements in a collection of elements comprises generating, via hash logic, hash values for each element of the collection of elements. The method further comprises specifying, in a sketch-frequency table, a set of discrete statistical values associated with the hash values and, for each discrete statistical value of the set of discrete statistical values, information indicative of a frequency at which binary representations of the hash values are associated with the discrete statistical value. The cardinality of the collection of elements is estimated based on the sketch-frequency table.

Abstract: The disclosure provides a disease classification method and a disease classification device. The disease classification method includes: inputting samples into a first stage model and obtaining a first stage determination result; inputting first samples determined positive by the first stage model into a second stage high specificity model to obtain second samples determined to be positive and third samples determined to be negative and rule in the second samples; inputting fourth samples determined negative by the first stage model into a second stage high sensitivity model to obtain fifth samples determined to be positive and sixth samples determined to be negative and rule out the sixth samples; obtaining a second stage determination result of the second and sixth samples; and inputting the third and fifth samples not ruled in or ruled out into a third stage model and obtaining a third stage determination result of the third and fifth samples.

Abstract: A method for processing an out-of-order data stream includes inserting a new data stream element into a segment list according to a timestamp of the new data stream element. It is identified whether there are missing data stream elements between segments in the segment list. The segments which have no missing data stream elements between them are merged. Values of the data stream elements are aggregated using a sliding window over out-of-order data stream elements in the merged segment.

Abstract: The present teaching relates to streaming data querying and providing query results. In one example, a query is received for events happening after receipt of the query. A plurality of data records are obtained, where each of the data records corresponds to an event happening after receipt of the query. For each of the plurality of data records, it is determined whether the data record matches the query. Based on the determining, one or more query results are determined and provided as a response to the query.

Abstract: A search apparatus including: a storage configured to store search target data; and a calculator configured to perform search processing for the search target data based on key data, the search target data being data of a multiway tree structure including an internal node array and a leaf node array, each internal node includes a bit vector representing whether a transition destination is an internal node or a leaf node by a bit, and the calculator is configured to repeatedly execute, until a transition node becomes a leaf node, processing of obtaining a chunk of a predetermined bit length from the key data, determining whether a transition destination from the internal node is an internal node or a leaf node based on a bit, in the bit vector of the accessing internal node, that corresponds to a value of the chunk, and accessing a node of the transition destination.

Abstract: Throughput is preserved in a distributed system while maintaining concurrency by pushing a commit wait period to client commit paths and to future readers. As opposed to servers performing commit waits, the servers assign timestamps, which are used to ensure that causality is preserved. When a server executes a transaction that writes data to a distributed database, the server acquires a user-level lock, and assigns the transaction a timestamp equal to a current time plus an interval corresponding to bounds of uncertainty of clocks in the distributed system. After assigning the timestamp, the server releases the user-level lock. Any client devices, before performing a read of the written data, must wait until the assigned timestamp is in the past.

Abstract: A system and method for visualizing and querying high dimensional data to a user. The system includes a user device, a data-pearls visualization and querying server. The server obtains the high dimensional data from the user device associated with user. The server generates data clusters and sub-divides the data clusters into non-overlapping subsets of data-pearls using a clustering technique. The server selects a shape for each data-pearl by comparing a distance between centroid of a data-pearl and a farthest point from a determined centroid using Lp norm distance measures. The server configures each data-pearl in a three-dimensional plot. The server enables the user to visualize the data-pearls on a screen of the user device. The server queries data based on a query using data dimension technique. The server dimensions data related to the query through determined classifiers based on filtered data after pruning unrelated data to the query.

Abstract: Techniques for enabling deduplication-aware load balancing in a distributed storage system are provided. In one set of embodiments, a node of the distributed storage system can receive an I/O (Input/Output) request pertaining to a data block of a storage object stored on a local storage component of the node. The node can further determine whether the I/O request requires insertion of a new entry into a deduplication hash table associated with the local storage component or deletion of an existing entry from the deduplication hash table. If the I/O request requires insertion of a new hash table entry, the node can add an identifier of the data block into a probabilistic data structure associated with the local storage component, where the probabilistic data structure is configured to maintain information regarding distinct data blocks that are likely present in the local storage component.

Abstract: Some implementations generate logical queries from a canonical query, where the logical queries each reflect a modified scope of the canonical query. Implementations receive, via a personalized analytics system, a canonical query that is associated with a user. The canonical query can be analyzed to determine an intent of the canonical query. In turn, one or more implementations generate, based on the intent an anecdotal information associated with the user, a logical query that reflects a modified scope of the canonical query. The logical query can be used to extract data from a database associated with the personalized analytics system based on the modified scope.

Abstract: An information processing apparatus includes: a receiver configured to receive an utterance content of a speaker, a processing structure of a work in which the speaker utters, the work including plural processing units, and a processing unit in execution in the processing structure; an extraction unit configured to extract a related document including a sentence whose similarity to the utterance content of the speaker received by the receiver is equal to or higher than a threshold, from among related documents that are associated in advance with at least one processing unit including the processing unit in execution received by the receiver; and a setting unit configured to set a processing unit from which the extraction unit extracts a related document next, according to the processing structure received by the receiver.

Abstract: In one example in accordance with the present disclosure, a method for domain classification includes sorting a set of sample domains into leaves based on syntactical features of the domains. Each sample domain belongs to a family of domains. The method also includes identifying, for each leaf, a regular expression for each family with at least one domain in the leaf. The method also includes determining, for each leaf, at least one lobe with a set of domains in the leaf that matches the regular expression for a first family with at least one domain in the leaf, and that does not match the regular expression for the other families with at least one domain in the leaf. The method also includes creating a classifier for the domains in each lobe by using the set of domains from each family in the lobe as training classes for machine learning.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for improving distributed monitoring using different groups of remote devices. In some implementations, a system communicates with a set of remote devices involved in a first monitoring program that involves collection of data from the remote devices over a communication network. The system identifies a pattern or similarity among monitoring data collected from a subset of the remote devices involved in the first monitoring program. The system determines that the identified pattern or similarity satisfies one or more criteria for initiating additional monitoring. In response, the system determines parameters specifying second types of data to collect in a second monitoring program. The system configures one or more devices to perform monitoring for the second monitoring program including acquiring data for the second types of data and providing the acquired data to a server over the communication network.

Abstract: A method and system for forecasting a histogram in a database system is provided. The method includes determining that database table statistics and historical statistical histograms associated with specified subject matter have been previously retrieved. The database table statistics and historical statistical histograms are retrieved and determined to be frequency based histograms. Historical target values associated with the historical statistical histograms are identified and new target values associated with the historical target values are identified. A value identifying a number of occurrences for identified target values comprising the new target values and the historical target values is forecast and database table histograms comprising the identified target values are stored.

Abstract: Aspects discussed herein relate to employing deep learning to automate mapping and transformation of a source data set to a target data schema. A system may utilize deep learning algorithms to determine a mapping from the source schema to the target schema through identifying the source schema and creating a correspondence between source fields and target fields, and a corresponding data transformation. Artificial neural networks, configured as schema-level and instance-level classifiers, may generate a set of predictions based on the fields of the source data set and fields of the target data schema. These predictions may be combined with other predictions based on other criteria (such as similarity between the fields) to generate a complete prediction of a schema mapping. Similarly, deep learning techniques may be employed to determine an appropriate data transformation to transform source data content to an appropriate format for corresponding fields of the target schema.

Abstract: In accordance with an embodiment, described herein is a system and method for providing sandboxing support in a multidimensional database environment. A plurality of sandboxes and a baseline data can be provided in a multidimensional database server, with each sandbox created for a particular “what-if” analysis, and configured to store one or more changes to the baseline data. When a request is received for a report on a particular “what-if” analysis from a client/user, the multidimensional database server can split the request into a first query and the second query, with the first query directed to a sandbox associated with the client/user, and the second query directed to the baseline data. The multidimensional database server can merge results from the first query and the second query, and perform aggregations and calculations on the merged data, before sending the merged data to a client.

Abstract: In a computerized search system, a document corpus is searched according to a query and results of the search are presentable as an ordered search result set comprising one or more search hits, a search hit being a document of the document corpus or reference thereto. Based on content of the search result set, a number of suggested queries and/or parameter options are presented to a querier, thereby allowing the querier to select a suggested query and/or provide values for the parameters and those selections can be used to reorder the hits of the search result set. The particular suggested queries and/or parameters presented depend on the page elements of the search result set's documents and their categorization. The categorization might be done using concept networks.

Abstract: A data storage system performs updating of a set of global counters stored in persistent storage accessible to a plurality of processing nodes of a data storage system, the global counters storing respective global count values describing associated units of data storage shared by the processing nodes for performing data storage operations. The updating includes, by each processing node, using a respective set of in-memory delta counters storing respective delta count values to track changes to respective global count values due to data storage operations performed by the processing node with respect to the units of data storage. A summarization process is regularly executed to merge the delta count values of the delta counters of all processing nodes into the respective global counters.

Abstract: The present disclosure provides a data clustering method based on K-nearest neighbor, which sorts data points to be clustered in ascending order according to the maximum radiuses of K-nearest neighbors of the data points, that is, according to the density, and perform the first pass across the data points after sorting the data points in ascending order to incorporate the data points that conform to the statistical similarity into the same cluster; then perform the second pass across the data points with smaller cluster density according to the scale required during the clustering to find out all noise points and incorporate non-noise points into the nearest large-density cluster, so as to realize data clustering, which has the benefits of no need to preset the number of clusters and know the probability distribution of the data and convenience to set parameters.

Abstract: An image forming apparatus includes a communication interface through which the image forming apparatus communicates with a server and circuitry. The circuitry is configured to: collect learning data; and determine whether to generate a learning model by the server based on the collected learning data or to generate a learning model by the circuitry based on the collected learning data.

Abstract: Systems, apparatus, and methods are disclosed for performing scalable operations in a file system. Metadata entries in a namespace or directory tree are sharded across multiple file metadata servers. An augmented enumeration operation, such as listing a directory, is parallelized across the multiple file metadata servers, transparently to clients. Exemplary augmentation features can include filtering and sorting. Augmentation features can be executed concurrently with enumeration, prior to enumeration, after enumeration, or as a combination of these, and can utilize pre-built index structures or holding structures for intermediate results. Augmented enumeration operations can also include no-output operations such as changing file attributes or deleting a file, and cumulative operations such as counting total disk space usage. The parallelization is compatible with tree-level parallelization and storage-level parallelization.

Abstract: Technologies for binary data distribution include a source computing device and a recipient computing device. The source computing device profiles a binary file payload to generate a payload fingerprint and generates a text-encoded payload as a function of the binary file payload. The source computing device combines the text-encoded payload and metadata including the payload fingerprint to generate a message data structure, and serializes the message data structure to generate a serialized message. The source computing device may sign the text-encoded payload and the metadata to generate a signature included in the serialized message. The source computing device transmits the serialized message to the recipient computing device, which loads the text-encoded payload and the payload fingerprint from the serialized message, decodes the text-encoded payload to recover the binary file payload, and verifies the binary file payload with the payload fingerprint. Other embodiments are described and claimed.

Abstract: Disclosed are an apparatus and method for generating a natural language. According to an embodiment of the present disclosure, the method for generating the natural language includes receiving a plurality of pieces of data, generating a sentence ID sequence including one or more sentence IDs from the plurality of pieces of data, and generating a sentence corresponding to each of the sentence IDs included in the sentence ID sequence from the sentence ID sequence and the plurality of pieces of data.

Abstract: A computer-implemented method, computer program product and system for data sampling in a storage system. The storage system includes a dataset comprising records and a buffer. The dataset is scanned record-by-record to determine whether the current record belongs to a random sample. If so, then the current record may be added to a first set of records. Otherwise, at least one storage score may be calculated or determined for the current record using attribute values of the current record. Next, it may be determined whether the buffer includes available size for storing the current record. In case the buffer comprises the available size, the current record may be stored in the buffer. Otherwise, at least part of the buffer may be free up. A subsample of the dataset may be provided as a result of merging the first set of records and at least part of the buffered records.

Abstract: An information processing apparatus includes a processor that executes a process including calculating, for each of a plurality of registered users from which feature values have been obtained in advance, an index value indicating a probability of an authentication target being that registered user based on a matching degree between a feature value extracted from authentication information obtained from the authentication target and a feature value of that registered user, setting a synthesized access right by synthesizing, based on the index value, an access right of a certain one of the plurality of users to a plurality of resources and an access right of a user different from the certain registered user from among the plurality of registered users to the plurality of resources, and permitting the authentication target an access to a resource to which an access is permitted in the synthesized access right.

Abstract: Systems, apparatus, and methods are disclosed for performing scalable operations in a file system, including POSIX-like file systems. Metadata entries in a namespace or directory tree are sharded across multiple file metadata servers. An enumeration operation, such as listing a directory, is parallelized across the multiple file metadata servers, while retaining standard functionality transparently to clients. Other enumeration operations include no-output operations such as changing file attributes or deleting a file, and cumulative operations such as counting total disk space usage. The parallelization is compatible with tree-level parallelization and storage-level parallelization. Disclosed technologies can be applied to other fields requiring scalable enumeration, such as database and network applications.

Abstract: A method includes obtaining an initial answer entigen group from a knowledge database based on a query entigen group of a query. The method further includes determining that a reliable and definitive answer for the query is not obtainable from the initial answer entigen group. When an incomplete answer entigen is a cause for the inability to obtain the reliable and definitive answer, the method further includes determining a missing element, obtaining data regarding the missing element, updating the incomplete answer entigen with the data to produce an updated answer entigen, and updating the initial answer entigen group with the updated answer entigen to produce an updated answer entigen group. When the updated answer entigen group produces the reliable and definitive answer, the method further includes outputting the reliable and definitive answer.

Abstract: An item for designating a time stamp accuracy is added to an inquiry syntax of a query. At the time of table coupling, a query designating the desired accuracy in the item is transmitted. This query is analyzed by a query parser, and individual queries are created for each database targeted for inquiry and transmitted. At the time of coupling acquired tables, the number of digits of the time stamps is adjusted to be the same in accordance with the designated accuracy, and the tables are coupled in chronological order of the time stamps.

Abstract: A method, apparatus, and computer program product are disclosed for improved promotion targeting. An example apparatus includes a processor configured to cause retrieval of historical information regarding transactions associated with a plurality of identifier entities. The example apparatus further includes modeling circuitry configured to train a statistical model using the retrieved historical information, and estimate, using the statistical model, values for expected identifier entity transaction requests associated with each of the plurality of identifier entities. The processor of the example apparatus may further be configured to select, based on the estimated values, a subset of identifier entities to receive impressions of the promotion, and the apparatus may further include communications circuitry configured to transmit an impression of the promotion to each identifier entity in the subset.

Abstract: A method for optimizing memory usage for a hyperloglog (HLL) estimator is disclosed. When a multiset is applied to an HLL estimator, a sparse representation of a sketch may be created. The sparse representation may be sorted whenever a total number of buckets in the sparse representation is evenly divisible by a sorting threshold and is also less than a transition threshold. The sparse representation may be converted to a dense representation when the number of buckets in the sparse representation reaches the transition threshold.

Abstract: Automated database managers identify each of a plurality of different constraints that are each individually active for a data operation on a data value of a table data field of a relational database for a data operation. A database manager processor selects an untested one of the plurality of constraints as a selected constraint, and tests a field data value of the table data field for a defined condition of the selected constraint. In response to the test of the field data value meeting the defined condition of the selected constraint, the processor performs the data operation on the data value of the table data field, without testing any other untested ones of the plurality of different constraints.

Abstract: Systems, methods, and other embodiments are disclosed that are configured to provide distributed workbook storage for a multi-dimensional database system. In one embodiment, a workbook is created where the workbook is a personal data repository which is a subset of a domain of persistent multi-dimensional data cache of the multi-dimensional database system. A distributed storage location is selected for the workbook from multiple distributed storage locations of the data cache. A round robin selection process is used that promotes balanced loading and usage of multiple workbooks stored across the multiple distributed storage locations. A workbook directory structure is created for the workbook within the selected distributed storage location. The workbook directory structure reflects a same directory structure provided by a common global domain of the multi-dimensional database system up to a root directory of the selected distributed storage location.

Abstract: This invention relates to a system for and a method (100) of searching a collection of digital information (150) comprising a number of digital documents (110), the method comprising receiving or obtaining (102) a search query, the query comprising a number of search terms, searching (103) an index (300) using the search terms thereby providing information (301) about which digital documents (110) of the collection of digital information (150) that contains a given search term and one or more search related metrics (302; 303; 304; 305; 306), ranking (105) at least a part of the search query search result according to one or more predetermined criteria providing a ranked search result, and providing at least a part of the ranked search result (106), wherein the ranking provides robust likelihood for low count terms by using the one or more search related metrics (302; 303; 304; 305; 306).

Abstract: Techniques are described herein for introducing transcode operators into a generated operator tree during query processing. Setting up the transcode operators with correct encoding type at runtime is performed by inferring correct encoding type information during compile time. The inference of the correct encoding type information occurs in three phases during compile time: the first phase involves collecting, consolidating, and propagating the encoding-type information of input columns up the expression tree. The second phase involves pushing the encoding-type information down the tree for nodes in the expression tree that do not yet have any encoding-type assigned. The third phase involves determining which inputs to the current relational operator need to be pre-processed by a transcode operator.

Abstract: In general, embodiments of the present invention provide systems, methods and computer readable media configured to receive configuration data describing a desired data set distribution, and, in response to receiving new data instances, use the configuration data and the new data instances to dynamically optimize the distribution of data already stored in a data reservoir that has been discretized into bins representing the desired data distribution.

Abstract: A document understanding support apparatus as one embodiment of the present invention includes a word extraction condition learning device, a word extractor, a word relationship extraction condition learning device, a word relationship extractor, and an output device. The word extraction condition learning device creates a word extraction condition for extracting words from a target electronic document by machine-learning based on feature values assigned to respective words. The word extractor extracts words satisfying the word extraction condition. The word relationship extraction condition learning device creates a word relationship extraction condition for extracting word relationships from the target electronic document by machine-learning based on feature values with respect to extraction target word relationships. The word relationship extractor extracts a word relationship satisfying the word relationship extraction condition.

Abstract: Methods and systems for a virtual machine environment are provided. One method includes allocating a memory for storing a dirty pages data structure for tracking writes to a virtual machine memory by an adapter coupled to a computing device and shared by a plurality of virtual machines; initiating a tracking operation by the adapter or a virtual function driver to track writes to the virtual memory; providing access to the dirty pages data structure in response to a query command, while the adapter or the virtual function driver tracks writes to the virtual machine memory; and providing a number of dirty pages within the dirty pages data structure and a pointer the dirty pages data structure by the adapter or the virtual function driver.

Abstract: Various embodiments are described which leverage techniques for breaking down critical ideas from an inputted phrase into concepts in order to provide a response that is more relevant to the inputted phrase. In this regard, concepts and/or concept patterns are utilized with information retrieval searching to provide more relevant and concise documents in response to an inputted phrase. In addition, concepts and/or concept patterns are utilized with respect to assessing information (e.g., documents) available in a knowledge base and building appropriate pre-defined responses to an inputted phrase.

Abstract: Methods, apparatuses, systems, and program products are disclosed for secret fragmentation and distribution. A method includes generating a secret that may be divided into a plurality of segments such that the secret is re-constructed by combining each of the plurality of segments. A method includes assigning each of a plurality of users to one or more groups or groups of groups. A method includes mapping each of a plurality of segments of a secret to one or more of a plurality of users as a function of a number of users within each group. A method includes encoding each of a plurality of segments in a predefined format based on a mapping. A method includes distributing each of a plurality of encoded segments to each of one or more users that is mapped to each encoded segment.

Abstract: Techniques are disclosed for querying, retrieval, and presentation of data. A data analytic system can enable a user to provide input, through a device to query data. The data analytic system can identify the semantic meaning of the input and perform a query based on the semantic meaning. The data analytic system can crawl multiple different sources to determine a logical mapping of data for the index. The index may include one or more subject areas, terms defining those subject areas, and attributes for those terms. The index may enable the data analytic system to perform techniques for matching terms in the query to determine a semantic meaning of the query. The data analytic system can determine a visual representation best suited for displaying results of a query determined by semantic analysis of an input string by a user.

Abstract: A system includes reception of a request to modify the data of a database, the request including first data, execution of processing to fulfill the request, determination, during execution of the processing, that a validation exit is associated with a current state of the processing, storage of the first data in a local temporary table in response to the determination, passage of the local temporary table to the validation exit, and execution of the validation exit to validate the first data based on the local temporary table and on the data of the database.

Abstract: The present disclosure discloses an information category acquiring method and apparatus. The method includes: acquiring a browse record about a user browsing a Web page, the browse record including at least a Web page identifier of the Web page that the user browses; acquiring interestingness of the user for information categories according to the browse record; and acquiring an information category for which interestingness meets a first preset condition, and using the acquired information category as an information category in which the user is interested.

Abstract: An information processing apparatus which manages a file which holds information including a plurality of items, includes a processor, the processor configured to: search for a file satisfying a requested search condition based on item information obtained by associating the items and the number of files including the items, and file information indicating whether or not each of the files includes each item, and upon receipt of a deletion request of a file, update the number of files of items included in the file of a deletion target in the item information, and, when the number of files becomes 0, deletes an item whose number of files becomes 0 and the number of files including the item from the item information.

Abstract: An apparatus and a method for executing an automated analysis of analysis input data (e.g. social media data and/or On-Board-Diagnosis data) for product failure detection is proposed.

Abstract: A method and system for utilizing metadata to search for media, such as multimedia and streaming media, includes searching for the media, receiving results, extracting metadata associated with the media, enhancing the extracted metadata, and grouping the search results in accordance with attributes of the enhanced metadata. Enhancing and grouping include adding related metadata to the database of metadata, iteratively using metadata to search for more media related data, removing duplicate URLs, collapsing URLs that are variants of each other, and masking out superfluous terms from URLs. The resultant metadata and media files are available to users and search engines.