Sciweavers

187 search results - page 34 / 38
» Schema Matching using Duplicates
Sort
View
ICDE
2005
IEEE
106views Database» more  ICDE 2005»
14 years 28 days ago
Reconstructing XML Subtrees from Relational Storage of XML documents
Numerous researchers have proposed to use relational databases to store and query XML documents. One important component of such systems is the XML subtree reconstruction, which r...
Artem Chebotko, Dapeng Liu, Mustafa Atay, Shiyong ...
GRID
2003
Springer
14 years 16 days ago
Scoped and Approximate Queries in a Relational Grid Information Service
We are developing a grid information service, RGIS, that is based on the relational data model. RGIS supports complex queries written in SQL that search for compositions (using jo...
Dong Lu, Peter A. Dinda, Jason A. Skicewicz
APSEC
2002
IEEE
14 years 9 days ago
Embedding XML Processing Toolkit on General Purpose Programming Language
Many methods for XML processing have been proposed in the last few years. One popular approach is to process XML documents by using existing programming languages. Another popular...
Tetsuo Kamina, Tetsuo Tamai
HPDC
1998
IEEE
13 years 11 months ago
Matchmaking: Distributed Resource Management for High Throughput Computing
Conventional resource management systems use a system model to describe resources and a centralized scheduler to control their allocation. We argue that this paradigm does not ada...
Rajesh Raman, Miron Livny, Marvin H. Solomon
SIGMOD
2004
ACM
156views Database» more  SIGMOD 2004»
14 years 7 months ago
Tree Logical Classes for Efficient Evaluation of XQuery
XML is widely praised for its flexibility in allowing repeated and missing sub-elements. However, this flexibility makes it challenging to develop a bulk algebra, which typically ...
Stelios Paparizos, Yuqing Wu, Laks V. S. Lakshmana...