707 search results - page 43 / 142 » Processing queries on tree-structured data efficiently |
106
click to vote
EDBT
2009
ACM
15 years 3 months ago
2009
ACM
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...
101
click to vote
ASWC
2008
Springer
15 years 1 months ago
2008
Springer
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...
CIKM
2001
Springer
15 years 4 months ago
2001
Springer
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...
193
click to vote
ICDE
2006
IEEE
16 years 1 months ago
2006
IEEE
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...
SIGMOD
2002
ACM
16 years 1 days ago
2002
ACM
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...