Sciweavers

2859 search results - page 137 / 572
» Querying Complex Structured Databases
Sort
View
SIGMOD
2008
ACM
193views Database» more  SIGMOD 2008»
14 years 8 months ago
Efficient provenance storage
Scientific workflow systems are increasingly used to automate complex data analyses, largely due to their benefits over traditional approaches for workflow design, optimization, a...
Adriane Chapman, H. V. Jagadish, Prakash Ramanan
XSYM
2004
Springer
115views Database» more  XSYM 2004»
14 years 1 months ago
XQuery Processing with Relevance Ranking
Abstract. We are presenting a coherent framework for XQuery processing that incorporates IR-style approximate matching and allows the ordering of results by their relevance score. ...
Leonidas Fegaras
DBISP2P
2003
Springer
70views Database» more  DBISP2P 2003»
14 years 1 months ago
A Robust Logical and Computational Characterisation of Peer-to-Peer Database Systems
In this paper we give a robust logical and computational characterisation of peer-to-peer (p2p) database systems. We first define a precise model-theoretic semantics of a p2p sys...
Enrico Franconi, Gabriel M. Kuper, Andrei Lopatenk...
JCDCG
2000
Springer
13 years 11 months ago
Volume Queries in Polyhedra
We present a simple and practical data structure for storing a (not necessarily convex) polyhedron P which can, given a query surface S cutting the polyhedron, determine the volume...
John Iacono, Stefan Langerman
VLDB
1999
ACM
174views Database» more  VLDB 1999»
14 years 14 days ago
Extending Practical Pre-Aggregation in On-Line Analytical Processing
On-Line Analytical Processing (OLAP) based on a dimensional view of data is being used increasingly for the purpose of analyzing very large amounts of data. To improve query perfo...
Torben Bach Pedersen, Christian S. Jensen, Curtis ...