Sciweavers

239 search results - page 23 / 48
» Complete Geometrical Query Languages
Sort
View
SMA
2006
ACM
101views Solid Modeling» more  SMA 2006»
14 years 1 months ago
A higher dimensional formulation for robust and interactive distance queries
We present an efficient and robust algorithm for computing the minimum distance between a point and freeform curve or surface by lifting the problem into a higher dimension. This...
Joon-Kyung Seong, David E. Johnson, Elaine Cohen
ICDT
1995
ACM
101views Database» more  ICDT 1995»
13 years 11 months ago
Approximation in Databases
Partial information in databases can arise when information from several databases is combined. Even if each database is complete for some \world", the combined databases wil...
Leonid Libkin
SIGMOD
2009
ACM
201views Database» more  SIGMOD 2009»
14 years 7 months ago
Cost based plan selection for xpath
We present a complete XPath cost-based optimization and execution framework and demonstrate its effectiveness and efficiency for a variety of queries and datasets. The framework i...
Haris Georgiadis, Minas Charalambides, Vasilis Vas...
VLDB
2005
ACM
125views Database» more  VLDB 2005»
14 years 27 days ago
Rewriting XPath Queries Using Materialized Views
As a simple XML query language but with enough expressive power, XPath has become very popular. To expedite evaluation of XPath queries, we consider the problem of rewriting XPath...
Wanhong Xu, Z. Meral Özsoyoglu
VLDB
2007
ACM
166views Database» more  VLDB 2007»
14 years 7 months ago
Supporting Time-Constrained SQL Queries in Oracle
The growing nature of databases, and the flexibility inherent in the SQL query language that allows arbitrarily complex formulations, can result in queries that take inordinate am...
Ying Hu, Seema Sundara, Jagannathan Srinivasan