Sciweavers

123 search results - page 14 / 25
» Efficient B-tree Based Indexing for Cloud Data Processing
Sort
View
WWW
2008
ACM
13 years 7 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
LREC
2008
74views Education» more  LREC 2008»
13 years 9 months ago
Tapping Huge Temporally Indexed Textual Resources with WCTAnalyze
WCTAnalyze is a tool for storing, accessing and visually analyzing huge collections of temporally indexed data. It is motivated by applications in media analysis, business intelli...
Sebastian Gottwald, Matthias Richter, Gerhard Heye...
TKDE
2008
178views more  TKDE 2008»
13 years 7 months ago
Efficient Similarity Search over Future Stream Time Series
With the advance of hardware and communication technologies, stream time series is gaining ever-increasing attention due to its importance in many applications such as financial da...
Xiang Lian, Lei Chen 0002
DKE
1998
88views more  DKE 1998»
13 years 7 months ago
Temporal Grid File: A File Structure for Interval Data
Disk I/O is a major bottleneck for query processing in database applications. This bottleneck is especially a problem for temporal databases because of their large size. Reduction...
Chiang Lee, Te-Ming Tseng
ICIP
2001
IEEE
14 years 9 months ago
Color image coding, indexing and retrieval using binary space partitioning tree
This paper presents a unified approach to colour image coding, content-based indexing, and retrieval for database applications. The binary space partitioning (BSP) tree, tradition...
Guoping Qiu, S. Sudirman