5746 search results - page 918 / 1150 » Visualizing Query Structure |
131
click to vote
ICDE
2010
IEEE
16 years 6 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
195
click to vote
ICDE
2010
IEEE
16 years 6 months ago
2010
IEEE
Keyword search is considered to be an effective information discovery method for both structured and semistructured data. In XML keyword search, query semantics is based on the con...
171
click to vote
ICDE
2010
IEEE
16 years 6 months ago
2010
IEEE
Abstract-- Despite of advances in machine learning technologies, a schema matching result between two database schemas (e.g., those derived from COMA++) is likely to be imprecise. ...
183
click to vote
ICDE
2010
IEEE
16 years 1 months ago
2010
IEEE
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...
196
click to vote
CIVR
2007
Springer
16 years 20 days ago
2007
Springer
Ensuring the uniqueness of trademark images and protecting their identities are the most important objectives for the trademark registration process. To prevent trademark infringe...