3341 search results - page 296 / 669 » On Bounded Queries and Approximation |
185
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...
178
click to vote
SIGMOD
2010
ACM
15 years 10 months ago
2010
ACM
Substructure similarity search is to retrieve graphs that approximately contain a given query graph. It has many applications, e.g., detecting similar functions among chemical com...
144
click to vote
VMCAI
2007
Springer
16 years 25 days ago
2007
Springer
Abstraction frameworks use under-approximating transitions in order to prove existential properties of concrete systems. Under-approximating transifer to the concrete states that c...
260
click to vote
VLDB
2007
ACM
16 years 7 months ago
2007
ACM
Record matching is the task of identifying records that match the same real world entity. This is a problem of great significance for a variety of business intelligence applicatio...
192
click to vote
SIGMOD
2004
ACM
16 years 6 months ago
2004
ACM
Querying XML data is a well-explored topic with powerful databasestyle query languages such as XPath and XQuery set to become W3C standards. An equally compelling paradigm for que...