Sciweavers

685 search results - page 9 / 137
» Efficient Filtering Query Indexing in Data Stream
Sort
View
PVLDB
2008
108views more  PVLDB 2008»
13 years 7 months ago
Taming verification hardness: an efficient algorithm for testing subgraph isomorphism
Graphs are widely used to model complicated data semantics in many applications. In this paper, we aim to develop efficient techniques to retrieve graphs, containing a given query...
Haichuan Shang, Ying Zhang, Xuemin Lin, Jeffrey Xu...
TKDE
2010
197views more  TKDE 2010»
13 years 2 months ago
Filtering Data Streams for Entity-Based Continuous Queries
The idea of allowing query users to relax their correctness requirements in order to improve performance of a data stream management system (e.g., location-based services and senso...
Reynold Cheng, Benjamin C. M. Kao, Alan Kwan, Suni...
TKDE
2002
148views more  TKDE 2002»
13 years 7 months ago
Parallel Star Join + DataIndexes: Efficient Query Processing in Data Warehouses and OLAP
On-Line Analytical Processing (OLAP) refers to the technologies that allow users to efficiently retrieve data from the data warehouse for decision-support purposes. Data warehouses...
Anindya Datta, Debra E. VanderMeer, Krithi Ramamri...
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
SIGMOD
2003
ACM
140views Database» more  SIGMOD 2003»
14 years 7 months ago
Stream Processing of XPath Queries with Predicates
We consider the problem of evaluating large numbers of XPath filters, each with many predicates, on a stream of XML documents. The solution we propose is to lazily construct a sin...
Ashish Kumar Gupta, Dan Suciu