Sciweavers

311 search results - page 7 / 63
» Approximate XML joins
Sort
View
95
Voted
SIGMOD
2003
ACM
174views Database» more  SIGMOD 2003»
15 years 9 months ago
ViST: A Dynamic Index Method for Querying XML Data by Tree Structures
With the growing importance of XML in data exchange, much research has been done in providing flexible query facilities to extract data from structured XML documents. In this pape...
Haixun Wang, Sanghyun Park, Wei Fan, Philip S. Yu
PODS
2001
ACM
135views Database» more  PODS 2001»
15 years 9 months ago
On the Complexity of Join Predicates
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins com...
Jin-yi Cai, Venkatesan T. Chakaravarthy, Raghav Ka...
DBKDA
2010
IEEE
169views Database» more  DBKDA 2010»
15 years 2 months ago
XLeaf: Twig Evaluation with Skipping Loop Joins and Virtual Nodes
Abstract—XML indexing and search has become an important topic, and twig joins are key building blocks in XML search systems. This paper describes a novel approach using a nested...
Nils Grimsmo, Truls Amundsen Bjørklund, &Os...
96
Voted
ICDCIT
2004
Springer
15 years 2 months ago
Querying XML Documents from a Relational Database in the Presence of DTDs
Abstract. Many researchers have investigated the problem of storing and querying XML documents using an RDBMS. Two situations are considered in this approach based on whether or no...
Manjeet Rege, Izabell Caraconcea, Shiyong Lu, Fars...
XIMEP
2004
ACM
88views Database» more  XIMEP 2004»
15 years 3 months ago
XQuery Processing in Natix with an Emphasis on Join Ordering
We give an overview on how XQuery processing works in our native XML database system Natix. After a brief description of the query compiler we focus on the aspect of join ordering...
Norman May, Sven Helmer, Carl-Christian Kanne, Gui...