Sciweavers

3020 search results - page 168 / 604
» Similarity Queries on Structured Data in Structured Overlays
Sort
View
ISMB
1993
15 years 8 months ago
Discovering Sequence Similarity by the Algorithmic Significance Method
The minimal-length encoding approach is applied to define concept of sequence similarity. Asequence is defined to be similar to another sequence or to a set of keywords if it can ...
Aleksandar Milosavljevic
ICDE
2007
IEEE
118views Database» more  ICDE 2007»
16 years 8 months ago
Using Queries to Associate Metadata with Data
As relational databases proliferate and become increasingly complex, both in their internal structure and in their interactions with other databases and applications, there is a g...
Divesh Srivastava, Yannis Velegrakis
CINQ
2004
Springer
163views Database» more  CINQ 2004»
16 years 10 hour ago
Frequent Itemset Discovery with SQL Using Universal Quantification
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...
Ralf Rantzau
VLDB
1992
ACM
151views Database» more  VLDB 1992»
15 years 10 months ago
A Uniform Approach to Processing Temporal Queries
Research in temporal databases has mainly focused on defining temporal data models by extending existing models, and developing access structures for temporal data. Little has bee...
Umeshwar Dayal, Gene T. J. Wuu
ICDE
2010
IEEE
258views Database» more  ICDE 2010»
16 years 1 months ago
Anonymized Data: Generation, models, usage
Data anonymization techniques have been the subject of intense investigation in recent years, for many kinds of structured data, including tabular, item set and graph data. They e...
Graham Cormode, Divesh Srivastava