Sciweavers

479 search results - page 72 / 96
» Efficient Processing of XML Tree Pattern Queries
Sort
View
DASFAA
2004
IEEE
158views Database» more  DASFAA 2004»
14 years 1 months ago
A Cost Model for Spatial Intersection Queries on RI-Trees
Abstract. The efficient management of interval sequences represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tr...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
CIKM
2006
Springer
14 years 29 days ago
TRIPS and TIDES: new algorithms for tree mining
Recent research in data mining has progressed from mining frequent itemsets to more general and structured patterns like trees and graphs. In this paper, we address the problem of...
Shirish Tatikonda, Srinivasan Parthasarathy, Tahsi...
SSDBM
2002
IEEE
149views Database» more  SSDBM 2002»
14 years 2 months ago
A Cost Model for Interval Intersection Queries on RI-Trees
The efficient management of interval data represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tree1 ), an effi...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
CSB
2005
IEEE
136views Bioinformatics» more  CSB 2005»
14 years 2 months ago
Computational Method for Temporal Pattern Discovery in Biomedical Genomic Databases
With the rapid growth of biomedical research databases, opportunities for scientific inquiry have expanded quickly and led to a demand for computational methods that can extract b...
Mohammed I. Rafiq, Martin J. O'Connor, Amar K. Das
DEBU
2008
123views more  DEBU 2008»
13 years 9 months ago
Pathfinder: XQuery Off the Relational Shelf
The Pathfinder project makes inventive use of relational database technology--originally developed to process data of strictly tabular shape--to construct efficient database-suppo...
Torsten Grust, Jan Rittinger, Jens Teubner