Sciweavers

439 search results - page 27 / 88
» Unnesting Arbitrary Queries
Sort
View
WEBDB
2000
Springer
128views Database» more  WEBDB 2000»
14 years 1 months ago
Architecting a Network Query Engine for Producing Partial Results
The growth of the Internet has made it possible to query data in all corners of the globe. This trend is being abetted by the emergence of standards for data representation, such ...
Jayavel Shanmugasundaram, Kristin Tufte, David J. ...
ESA
2007
Springer
101views Algorithms» more  ESA 2007»
14 years 4 months ago
Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra
We consider the problem of ray shooting in a three-dimensional scene consisting of k (possibly intersecting) convex polyhedra with a total of n facets. That is, we want to preproc...
Haim Kaplan, Natan Rubin, Micha Sharir
ICCS
2009
Springer
14 years 4 months ago
Querying for Feature Extraction and Visualization in Climate Modeling
The ultimate goal of data visualization is to clearly portray features relevant to the problem being studied. This goal can be realized only if users can effectively communicate t...
C. Ryan Johnson, Markus Glatter, Wesley Kendall, J...
ICDCIT
2004
Springer
14 years 3 months ago
Querying XML Documents from a Relational Database in the Presence of DTDs
Abstract. Many researchers have investigated the problem of storing and querying XML documents using an RDBMS. Two situations are considered in this approach based on whether or no...
Manjeet Rege, Izabell Caraconcea, Shiyong Lu, Fars...
COMPGEOM
1997
ACM
14 years 2 months ago
Approximate Nearest Neighbor Queries Revisited
This paper proposes new methods to answer approximate nearest neighbor queries on a set of n points in d-dimensional Euclidean space. For any xed constant d, a data structure with...
Timothy M. Chan