Sciweavers

6615 search results - page 354 / 1323
» Indexing Multiple Sets
Sort
View
EJC
2010
15 years 6 months ago
On loop identities that can be obtained by a nuclear identification
We start by describing all the varieties of loops Q that can be defined by autotopisms x, x Q, where x is a composition of two triples, each of which becomes an autotopism when th...
Ales Drápal, Premysl Jedlicka
SIGMOD
2003
ACM
129views Database» more  SIGMOD 2003»
16 years 7 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
IDEAS
2000
IEEE
112views Database» more  IDEAS 2000»
15 years 11 months ago
Bulk Loading a Data Warehouse Built Upon a UB-Tree
This paper considers the issue of bulk loading large data sets for the UB-Tree, a multidimensional index structure. Especially in dataware housing (DW), data mining and OLAP it is...
Robert Fenk, Akihiko Kawakami, Volker Markl, Rudol...
ICDE
2003
IEEE
120views Database» more  ICDE 2003»
16 years 8 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 ...
WWW
2004
ACM
16 years 7 months ago
An automatic semantic relationships discovery approach
An important obstacle to the success of the Semantic Web is that the establishment of the semantic relationship is labor-intensive. This paper proposes an automatic semantic relat...
Hai Zhuge, Liping Zheng, Nan Zhang 0007, Xiang Li