Sciweavers

91 search results - page 11 / 19
» TID Hash Joins
Sort
View
IJSWIS
2008
135views more  IJSWIS 2008»
13 years 8 months ago
Efficient Processing of RDF Queries with Nested Optional Graph Patterns in an RDBMS
Relational technology has shown to be very useful for scalable Semantic Web data management. Numerous researchers have proposed to use RDBMSs to store and query voluminous RDF dat...
Artem Chebotko, Shiyong Lu, Mustafa Atay, Farshad ...
TELETRAFFIC
2007
Springer
14 years 2 months ago
Estimating Churn in Structured P2P Networks
In structured peer-to-peer (P2P) networks participating peers can join or leave the system at arbitrary times, a process which is known as churn. Many recent studies revealed that ...
Andreas Binzenhöfer, Kenji Leibnitz
CIKM
1998
Springer
14 years 24 days ago
Efficient Enumeration of Frequent Sequences
In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex has...
Mohammed Javeed Zaki
SIGMOD
2004
ACM
241views Database» more  SIGMOD 2004»
14 years 8 months ago
SINA: Scalable Incremental Processing of Continuous Queries in Spatio-temporal Databases
This paper introduces the Scalable INcremental hash-based Algorithm (SINA, for short); a new algorithm for evaluating a set of concurrent continuous spatio-temporal queries. SINA ...
Mohamed F. Mokbel, Xiaopeng Xiong, Walid G. Aref
DAMON
2007
Springer
14 years 2 months ago
A general framework for improving query processing performance on multi-level memory hierarchies
We propose a general framework for improving the query processing performance on multi-level memory hierarchies. Our motivation is that (1) the memory hierarchy is an important pe...
Bingsheng He, Yinan Li, Qiong Luo, Dongqing Yang