Sciweavers

48 search results - page 1 / 10
» PBiTree Coding and Efficient Processing of Containment Joins
Sort
View
ICDE
2003
IEEE
120views Database» more  ICDE 2003»
14 years 6 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 ...
ADC
2009
Springer
145views Database» more  ADC 2009»
13 years 8 months ago
Efficient XQuery Join Processing in Publish/Subscribe Systems
Efficient XML filtering has been a fundamental technique in recent Web service and XML publish/subscribe applications. In this paper, we consider the problem of filtering a contin...
Ryan H. Choi, Raymond K. Wong
SIGMOD
2003
ACM
129views Database» more  SIGMOD 2003»
14 years 5 months ago
Efficient Processing of Joins on Set-valued Attributes
Object-oriented and object-relational DBMS support setvalued attributes, which are a natural and concise way to model complex information. However, there has been limited research...
Nikos Mamoulis
SIGMOD
2003
ACM
145views Database» more  SIGMOD 2003»
14 years 5 months ago
Containment Join Size Estimation: Models and Methods
Recent years witnessed an increasing interest in researches in XML, partly due to the fact that XML has now become the de facto standard for data interchange over the internet. A ...
Wei Wang 0011, Haifeng Jiang, Hongjun Lu, Jeffrey ...
TKDE
1998
142views more  TKDE 1998»
13 years 4 months ago
Performance Analysis of Three Text-Join Algorithms
—When a multidatabase system contains textual database systems (i.e., information retrieval systems), queries against the global schema of the multidatabase system may contain a ...
Weiyi Meng, Clement T. Yu, Wei Wang 0010, Naphtali...