Sciweavers

191 search results - page 5 / 39
» XPath Query Evaluation: Improving Time and Space Efficiency
Sort
View
VLDB
2007
ACM
114views Database» more  VLDB 2007»
14 years 8 months ago
Optimization and evaluation of shortest path queries
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...
Edward P. F. Chan, Heechul Lim
SIGMOD
2005
ACM
168views Database» more  SIGMOD 2005»
14 years 8 months ago
No pane, no gain: efficient evaluation of sliding-window aggregates over data streams
Window queries are proving essential to data-stream processing. In this paper, we present an approach for evaluating sliding-window aggregate queries that reduces both space and c...
Jin Li, David Maier, Kristin Tufte, Vassilis Papad...
ICDE
2004
IEEE
137views Database» more  ICDE 2004»
14 years 9 months ago
Selectivity Estimation for XML Twigs
Twig queries represent the building blocks of declarative query languages over XML data. A twig query describes a complex traversal of the document graph and generates a set of el...
Neoklis Polyzotis, Minos N. Garofalakis, Yannis E....
JUCS
2007
122views more  JUCS 2007»
13 years 8 months ago
Efficient Access Methods for Temporal Interval Queries of Video Metadata
: Indexing video content is one of the most important problems in video databases. In this paper we present linear time and space algorithms for handling video metadata that repres...
Spyros Sioutas, Kostas Tsichlas, Bill Vassiliadis,...
WWW
2008
ACM
13 years 8 months ago
Divide, Compress and Conquer: Querying XML via Partitioned Path-Based Compressed Data Blocks
We propose a novel Partition Path-Based (PPB) grouping strategy to store compressed XML data in a stream of blocks. In addition, we employ a minimal indexing scheme called Block S...
Wilfred Ng, Ho Lam Lau, Aoying Zhou