Sciweavers

354 search results - page 21 / 71
» Efficient Processing of Spatial Joins Using R-Trees
Sort
View
ICDE
2005
IEEE
160views Database» more  ICDE 2005»
14 years 9 months ago
Evaluation of Spatio-Temporal Predicates on Moving Objects
Moving objects databases managing spatial objects with continuously changing position and extent over time have recently found large interest in the database community. Queries ab...
Markus Schneider
VLDB
1997
ACM
97views Database» more  VLDB 1997»
14 years 18 days ago
The Complexity of Transformation-Based Join Enumeration
Query optimizers that explore a search space exhaustively using transformation rules usually apply all possible rules on each alternative, and stop when no new information is prod...
Arjan Pellenkoft, César A. Galindo-Legaria,...
CIKM
2004
Springer
14 years 6 days ago
Efficient processing of XML twig patterns with parent child edges: a look-ahead approach
With the growing importance of semi-structure data in information exchange, much research has been done to provide an effective mechanism to match a twig query in an XML database....
Jiaheng Lu, Ting Chen, Tok Wang Ling
ISPAN
2002
IEEE
14 years 1 months ago
Parallel Selection Query Processing Involving Index in Parallel Database Systems
Index is an important element in databases, and the existence of index is unavoidable. When an index has been built on a particular attribute, database operations (e.g. selection,...
J. Wenny Rahayu, David Taniar
ICCAD
2007
IEEE
134views Hardware» more  ICCAD 2007»
14 years 10 days ago
Efficient decoupling capacitance budgeting considering operation and process variations
This paper solves the variation-aware on-chip decoupling capacitance (decap) budgeting problem. Unlike previous work assuming the worst-case current load, we develop a novel stocha...
Yiyu Shi, Jinjun Xiong, Chunchen Liu, Lei He