Sciweavers

707 search results - page 43 / 142
» Processing queries on tree-structured data efficiently
Sort
View
EDBT
2009
ACM
145views Database» more  EDBT 2009»
14 years 16 days ago
Efficient top-k count queries over imprecise duplicates
We propose efficient techniques for processing various TopK count queries on data with noisy duplicates. Our method differs from existing work on duplicate elimination in two sign...
Sunita Sarawagi, Vinay S. Deshpande, Sourabh Kasli...
ASWC
2008
Springer
13 years 10 months ago
Efficient Index Maintenance for Frequently Updated Semantic Data
Abstract. Nowadays, the demand on querying and searching the Semantic Web is increasing. Some systems have adopted IR (Information Retrieval) approaches to index and search the Sem...
Yan Liang, Haofen Wang, Qiaoling Liu, Thanh Tran, ...
CIKM
2001
Springer
14 years 1 months ago
X007: Applying 007 Benchmark to XML Query Processing Tool
If XML is to play the critical role of the lingua franca for Internet data interchange that many predict, it is necessary to start designing and adopting benchmarks allowing the c...
Stéphane Bressan, Gillian Dobbie, Zoé...
ICDE
2006
IEEE
167views Database» more  ICDE 2006»
14 years 10 months ago
Better Burst Detection
A burst is a large number of events occurring within a certain time window. As an unusual activity, it's a noteworthy phenomenon in many natural and social processes. Many da...
Xin Zhang, Dennis Shasha
SIGMOD
2002
ACM
165views Database» more  SIGMOD 2002»
14 years 8 months ago
APEX: an adaptive path index for XML data
The emergence of the Web has increased interests in XML data. XML query languages such as XQuery and XPath use label paths to traverse the irregularly structured data. Without a s...
Chin-Wan Chung, Jun-Ki Min, Kyuseok Shim