709 search results - page 118 / 142 » Efficient Evaluation of All-Nearest-Neighbor Queries |
106
click to vote
ICDE
2007
IEEE
15 years 6 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, ...
EDBTW
2006
Springer
14 years 2 months ago
2006
Springer
Geospatial image data obtained by satellites and aircraft are increasingly important to a wide range of applications, such as disaster management, climatology, and environmental m...
ICDE
2010
IEEE
14 years 10 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...
JCDL
2009
ACM
14 years 5 months ago
2009
ACM
The utility of an enterprise search system is determined by three key players: the information retrieval (IR) system (the search engine), the enterprise users, and the service pro...
ICDE
2005
IEEE
15 years 6 days ago
2005
IEEE
Large amounts of (often valuable) information are stored in web-accessible text databases. "Metasearchers" provide unified interfaces to query multiple such databases at...