Sciweavers

2859 search results - page 123 / 572
» Querying Complex Structured Databases
Sort
View
VLDB
2002
ACM
106views Database» more  VLDB 2002»
13 years 7 months ago
Efficient Algorithms for Processing XPath Queries
Our experimental analysis of several popular XPath processors reveals a striking fact: Query evaluation in each of the systems requires time exponential in the size of queries in ...
Georg Gottlob, Christoph Koch, Reinhard Pichler
CGI
1998
IEEE
14 years 14 days ago
Fast Approximate Quantitative Visibility for Complex Scenes
Ray tracing and Monte-Carlo based global illumination, as well as radiosity and other finite-element based global illumination methods, all require repeated evaluation of quantita...
Yiorgos Chrysanthou, Daniel Cohen-Or, Dani Lischin...
ADC
2007
Springer
125views Database» more  ADC 2007»
14 years 2 months ago
Building a Disordered Protein Database: A Case Study in Managing Biological Data
A huge diversity of biological databases is available via the Internet, but many of these databases have been developed in an ad hoc manner rather than in accordance with any data...
Arran D. Stewart, Xiuzhen Zhang
SIGMOD
2011
ACM
442views Database» more  SIGMOD 2011»
12 years 11 months ago
ArrayStore: a storage manager for complex parallel array processing
We present the design, implementation, and evaluation of ArrayStore, a new storage manager for complex, parallel array processing. ArrayStore builds on prior work in the area of m...
Emad Soroush, Magdalena Balazinska, Daniel L. Wang
SIGMOD
2002
ACM
134views Database» more  SIGMOD 2002»
14 years 8 months ago
QURSED: querying and reporting semistructured data
QURSED enables the development of web-based query forms and reports (QFRs) that query and report semistructured XML data, i.e., data that are characterized by nesting, irregularit...
Yannis Papakonstantinou, Michalis Petropoulos, Vas...