2859 search results - page 196 / 572 » Querying Complex Structured Databases |
218
click to vote
ICDT
2011
ACM
14 years 5 months ago
2011
ACM
Distributed data management systems consist of peers that store, exchange and process data in order to collaboratively achieve a common goal, such as evaluate some query. We study...
134
Voted
JODL
2000
15 years 2 months ago
2000
Z39.50 is a client/server protocol widely used in digital libraries and museums for searching and retrieving information spread over a number of heterogeneous sources. To overcome ...
CIKM
2009
Springer
15 years 9 months ago
2009
Springer
Given an author-conference graph, how do we answer proximity queries (e.g., what are the most related conferences for John Smith?); how can we tailor the search result if the user...
186
Voted
Publication
This paper presents a novel algorithm for Incremental and General Evaluation of continuous Reverse Nearest neighbor queries (IGERN, for short). The IGERN algorithm is general as it...
188
Voted
SIGMOD
2007
ACM
16 years 2 months ago
2007
ACM
Good cardinality estimates are critical for generating good execution plans during query optimization. Complex predicates, correlations between columns, and user-defined functions...