Sciweavers

707 search results - page 31 / 142
» Processing queries on tree-structured data efficiently
Sort
View
ISCI
2006
145views more  ISCI 2006»
13 years 8 months ago
Processing count queries over event streams at multiple time granularities
Management and analysis of streaming data has become crucial with its applications in web, sensor data, network traffic data, and stock market. Data streams consist of mostly nume...
Aykut Ünal, Yücel Saygin, Özgü...
ICDE
2009
IEEE
135views Database» more  ICDE 2009»
14 years 10 months ago
Space-Constrained Gram-Based Indexing for Efficient Approximate String Search
Abstract-- Answering approximate queries on string collections is important in applications such as data cleaning, query relaxation, and spell checking, where inconsistencies and e...
Alexander Behm, Shengyue Ji, Chen Li, Jiaheng Lu
ICDE
2003
IEEE
155views Database» more  ICDE 2003»
14 years 10 months ago
XR-Tree: Indexing XML Data for Efficient Structural Joins
XML documents are typically queried with a combination of value search and structure search. While querying by values can leverage traditional database technologies, evaluating st...
Haifeng Jiang, Hongjun Lu, Wei Wang 0011, Beng Chi...
ICDE
2003
IEEE
120views Database» more  ICDE 2003»
14 years 10 months ago
PBiTree Coding and Efficient Processing of Containment Joins
This paper addresses issues related to containment join processing in tree-structured data such as XML documents. A containment join takes two sets of XML node elements as input a...
Wei Wang 0011, Haifeng Jiang, Hongjun Lu, Jeffrey ...
VLDB
2005
ACM
87views Database» more  VLDB 2005»
14 years 2 months ago
An Efficient SQL-based RDF Querying Scheme
Devising a scheme for efficient and scalable querying of Resource Description Framework (RDF) data has been an active area of current research. However, most approaches define new...
Eugene Inseok Chong, Souripriya Das, George Eadon,...