301 search results - page 48 / 61 » Efficient Sketches for the Set Query Problem |
KDD
2006
ACM
15 years 11 months ago
2006
ACM
Privacy becomes a more and more serious concern in applications involving microdata. Recently, efficient anonymization has attracted much research work. Most of the previous metho...
98
Voted
TKDE
2008
14 years 10 months ago
2008
Given a dataset P, a k-means query returns k points in space (called centers), such that the average squared distance between each point in P and its nearest center is minimized. S...
VLDB
2002
ACM
14 years 10 months ago
2002
ACM
The problem of indexing path queries in semistructured/XML databases has received considerable attention recently, and several proposals have advocated the use of structure indexe...
190
click to vote
ICDE
2007
IEEE
16 years 8 days ago
2007
IEEE
Logical constraints, (e.g., 'phone numbers in toronto can have prefixes 416, 647, 905 only'), are ubiquitous in relational databases. Traditional integrity constraints, ...
80
Voted
ISCAS
2005
IEEE
15 years 4 months ago
2005
IEEE
—Unknown protein sequences are often compared to a set of known sequences (a database scan) to detect functional similarities. Even though efficient dynamic programming algorithm...