Sciweavers

721 search results - page 33 / 145
» Supporting top-k join queries in relational databases
Sort
View
ICDT
2007
ACM
114views Database» more  ICDT 2007»
15 years 3 months ago
Axiomatizing the Logical Core of XPath 2.0
The first aim of this paper is to present the logical core of XPath 2.0: a logically clean, decidable fragment, which includes most navigational features of XPath 2.0 (complex co...
Balder ten Cate, Maarten Marx
ICDE
2006
IEEE
127views Database» more  ICDE 2006»
15 years 3 months ago
Processing Recursive XQuery over XML Streams: The Raindrop Approach
— XML stream applications bring the challenge of efficiently processing queries on sequentially accessible tokenbased data. For efficient processing of queries, we need to ensu...
Mingzhu Wei, Ming Li, Elke A. Rundensteiner, Mural...
ICDE
2002
IEEE
138views Database» more  ICDE 2002»
15 years 11 months ago
Efficient Temporal Join Processing Using Indices
We examine the problem of processing temporal joins in the presence of indexing schemes. Previous work on temporal joins has concentrated on non-indexed relations which were fully...
Donghui Zhang, Vassilis J. Tsotras, Bernhard Seege...
VLDB
2005
ACM
185views Database» more  VLDB 2005»
15 years 10 months ago
Storing and querying XML data using denormalized relational databases
XML database systems emerge as a result of the acceptance of the XML data model. Recent works have followed the promising approach of building XML database management systems on un...
Andrey Balmin, Yannis Papakonstantinou
184
Voted
ICDE
2003
IEEE
120views Database» more  ICDE 2003»
15 years 11 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 ...