19798 search results - page 3789 / 3960 » Is Structural Subtyping Useful |
203
Voted
VLDB
2003
ACM
16 years 4 months ago
2003
ACM
On the Semantic Web, data will inevitably come from many different ontologies, and information processing across ontologies is not possible without knowing the semantic mappings be...
234
Voted
VLDB
2007
ACM
16 years 4 months ago
2007
ACM
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
230
Voted
VLDB
2007
ACM
16 years 4 months ago
2007
ACM
We study processing and authentication of long-running queries on outsourced data streams. In this scenario, a data owner (DO) constantly transmits its data to a service provider ...
257
click to vote
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
220
Voted
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
Existing keyword-search systems in relational databases require users to submit a complete query to compute answers. Often users feel "left in the dark" when they have l...