Sciweavers

688 search results - page 60 / 138
» Types for trees
Sort
View
126
Voted
WISE
2002
Springer
15 years 5 months ago
Storing and Maintaining Semistructured Data Efficiently in an Object-Relational Database
We propose to use object-relational database management systems to store and manage semi-structured data. ORA-SS (Object-Relationship-Attribute model for Semi-Structured data) [9]...
Yuanying Mo, Tok Wang Ling
CIKM
2008
Springer
15 years 2 months ago
Linear time membership in a class of regular expressions with interleaving and counting
The extension of Regular Expressions (REs) with an interleaving (shuffle) operator has been proposed in many occasions, since it would be crucial to deal with unordered data. Howe...
Giorgio Ghelli, Dario Colazzo, Carlo Sartiani
ICDE
1996
IEEE
228views Database» more  ICDE 1996»
16 years 2 months ago
Similarity Indexing with the SS-tree
Eficient indezing of high dimensional feature vectors is important to allow visual information systems and a number other applications to scale up to large databases. In this pape...
David A. White, Ramesh Jain
136
Voted
CADE
2005
Springer
16 years 1 months ago
Tabling for Higher-Order Logic Programming
We describe the design and implementation of a higher-order tabled logic programming interpreter where some redundant and infinite computation is eliminated by memoizing sub-comput...
Brigitte Pientka
99
Voted
SIGMOD
2004
ACM
143views Database» more  SIGMOD 2004»
16 years 29 days ago
Joining Interval Data in Relational Databases
The increasing use of temporal and spatial data in presentday relational systems necessitates an efficient support of joins on interval-valued attributes. Standard join algorithms...
Jost Enderle, Matthias Hampel, Thomas Seidl