Sciweavers

591 search results - page 69 / 119
» The complexity of XPath query evaluation
Sort
View
ICDT
2005
ACM
102views Database» more  ICDT 2005»
14 years 2 months ago
Selecting and Using Views to Compute Aggregate Queries (Extended Abstract)
d abstract) Foto Afrati1 and Rada Chirkova2 1 Electrical and Computing Eng., National Technical University of Athens, 157 73 Athens, Greece 2 Computer Science Department, North Car...
Foto N. Afrati, Rada Chirkova
DASFAA
2004
IEEE
158views Database» more  DASFAA 2004»
14 years 12 days ago
A Cost Model for Spatial Intersection Queries on RI-Trees
Abstract. The efficient management of interval sequences represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tr...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
ICDT
2009
ACM
109views Database» more  ICDT 2009»
14 years 9 months ago
TOP-K projection queries for probabilistic business processes
A Business Process (BP) consists of some business activities undertaken by one or more organizations in pursuit of some business goal. Tools for querying and analyzing BP specific...
Daniel Deutch, Tova Milo
IPSN
2009
Springer
14 years 3 months ago
Approximating sensor network queries using in-network summaries
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
Alexandra Meliou, Carlos Guestrin, Joseph M. Helle...
ESWS
2011
Springer
13 years 5 days ago
Optimizing Query Shortcuts in RDF Databases
The emergence of the Semantic Web has led to the creation of large semantic knowledge bases, often in the form of RDF databases. Improving the performance of RDF databases necessit...
Vicky Dritsou, Panos Constantopoulos, Antonios Del...