To enhance UDDI query capability, typically based on taxonomic classification, semantic matching is assuming a key role. Even if we recognize the great importance of semantics in ...
Algorithms for finding frequent itemsets fall into two broad classes: (1) algorithms that are based on non-trivial SQL statements to query and update a database, and (2) algorithms...
Text search engines return a set of k documents ranked by similarity to a query. Typically, documents and queries are drawn from natural language text, which can readily be partiti...
J. Shane Culpepper, Gonzalo Navarro, Simon J. Pugl...
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
— An approximate string query is to find from a collection of strings those that are similar to a given query string. Answering such queries is important in many applications su...