Sciweavers

1168 search results - page 91 / 234
» Optimization strategies for complex queries
Sort
View
CIKM
2008
Springer
14 years 12 months ago
A heuristic approach for checking containment of generalized tree-pattern queries
Query processing techniques for XML data have focused mainly on tree-pattern queries (TPQs). However, the need for querying XML data sources whose structure is very complex or not...
Pawel Placek, Dimitri Theodoratos, Stefanos Soulda...
ICRA
2006
IEEE
90views Robotics» more  ICRA 2006»
15 years 4 months ago
A Performance Comparison of Three Algorithms for Proximity Queries Relative to Convex Polyhedra
— This paper presents a comparative analysis relative to the experimental performances of an asymptotically fast and incremental algorithm, recently developed to compute collisio...
Stefano Carpin, Claudio Mirolo, Enrico Pagello
CORR
2008
Springer
125views Education» more  CORR 2008»
14 years 10 months ago
Adversary lower bounds for nonadaptive quantum algorithms
We present two general methods for proving lower bounds on the query complexity of nonadaptive quantum algorithms. Both methods are based on the adversary method of Ambainis. We sh...
Pascal Koiran, Jürgen Landes, Natacha Portier...
EDBT
2010
ACM
164views Database» more  EDBT 2010»
15 years 1 months ago
Techniques for efficiently querying scientific workflow provenance graphs
A key advantage of scientific workflow systems over traditional scripting approaches is their ability to automatically record data and process dependencies introduced during workf...
Manish Kumar Anand, Shawn Bowers, Bertram Ludä...
CHI
2011
ACM
14 years 1 months ago
Materializing the query with facet-streams: a hybrid surface for collaborative search on tabletops
We introduce “Facet-Streams”, a hybrid interactive surface for co-located collaborative product search on a tabletop. Facet-Streams combines techniques of information visualiz...
Hans-Christian Jetter, Jens Gerken, Michael Zö...