Sciweavers

1148 search results - page 116 / 230
» Using a relational database for scalable XML search
Sort
View
SEMWEB
2004
Springer
15 years 9 months ago
Querying Faceted Databases
Faceted classification allows one to model applications with complex classification hierarchies using orthogonal dimensions. Recent work has examined the use of faceted classi...
Kenneth A. Ross, Angel Janevski
CTRSA
2008
Springer
109views Cryptology» more  CTRSA 2008»
15 years 6 months ago
Super-Efficient Verification of Dynamic Outsourced Databases
We develop new algorithmic and cryptographic techniques for authenticating the results of queries over databases that are outsourced to an untrusted responder. We depart from previ...
Michael T. Goodrich, Roberto Tamassia, Nikos Trian...
145
Voted
IPPS
1998
IEEE
15 years 8 months ago
High Performance Data Mining Using Data Cubes on Parallel Computers
On-Line Analytical Processing techniques are used for data analysis and decision support systems. The multidimensionality of the underlying data is well represented by multidimens...
Sanjay Goil, Alok N. Choudhary
ICDE
2009
IEEE
155views Database» more  ICDE 2009»
15 years 11 months ago
SPROUT: Lazy vs. Eager Query Plans for Tuple-Independent Probabilistic Databases
— A paramount challenge in probabilistic databases is the scalable computation of confidences of tuples in query results. This paper introduces an efficient secondary-storage o...
Dan Olteanu, Jiewen Huang, Christoph Koch
133
Voted
CIDR
2009
180views Algorithms» more  CIDR 2009»
15 years 5 months ago
Data Management for High-Throughput Genomics
Today's sequencing technology allows sequencing an individual genome within a few weeks for a fraction of the costs of the original Human Genome project. Genomics labs are fa...
Uwe Röhm, José A. Blakeley