3319 search results - page 367 / 664 » Type Theoretical Databases |
138
Voted
IPPS
2003
IEEE
15 years 9 months ago
2003
IEEE
Aim of the paper is to develop a concise but comprehensive analytical model for the well-known Grace Hash Join algorithm on cost effective cluster architectures. This approach is ...
131
Voted
DBPL
2003
Springer
15 years 9 months ago
2003
Springer
We introduce the new notion of XML Stream Attribute Grammars (XSAGs). XSAGs are the first scalable query language for XML streams (running strictly in linear time with bounded mem...
132
click to vote
AUSAI
2007
Springer
15 years 7 months ago
2007
Springer
For knowledge representation and reasoning, there is a need to consider the nature of events because event data describe various features and behaviors of the occurrences of action...
125
click to vote
PODC
2010
ACM
15 years 7 months ago
2010
ACM
This paper deals with pipelined queries over services. The execution plan of such queries defines an order in which the services are called. We present the theoretical underpinni...
116
Voted
FIMI
2004
15 years 5 months ago
2004
Trie is a popular data structure in frequent itemset mining (FIM) algorithms. It is memory-efficient, and allows fast construction and information retrieval. Many trie-related tec...