2514 search results - page 243 / 503 » On the Computation of Approximations of Database Queries |
159
click to vote
CIKM
2005
Springer
16 years 6 days ago
2005
Springer
This paper shows a scheme for incremental evaluation of XPath queries. Here, we focus on a monotone fragment of XPath, i.e., when a data is deleted from (or inserted to) the datab...
208
click to vote
CNL
2009
15 years 7 months ago
2009
Abstract. As it is well-known, querying and managing structured data in natural language is a challenging task due to its ambiguity (syntactic and semantic) and its expressiveness....
230
click to vote
VLDB
1999
ACM
15 years 11 months ago
1999
ACM
The nearest- or near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing ...
184
Voted
SIGMOD
2010
ACM
15 years 11 months ago
2010
ACM
Fast query processing of complex objects, e.g. spatial or uncertain objects, depends on efficient spatial pruning of the objects’ approximations, which are typically minimum bou...
182
click to vote
ICPPW
2003
IEEE
15 years 12 months ago
2003
IEEE
Users have been demanding information “anytime, anywhere”. The notion of accessing diverse and autonomous information repositories with different APIs is not accepted. This ha...