Sciweavers

466 search results - page 34 / 94
» Efficient Object Querying for Java
Sort
View
201
Voted
SIGMOD
2005
ACM
109views Database» more  SIGMOD 2005»
16 years 2 months ago
Query-Sensitive Embeddings
A common problem in many types of databases is retrieving the most similar matches to a query object. Finding those matches in a large database can be too slow to be practical, es...
Vassilis Athitsos, Marios Hadjieleftheriou, George...
EDBT
2002
ACM
139views Database» more  EDBT 2002»
16 years 2 months ago
Aggregate Processing of Planar Points
Abstract. Aggregate window queries return summarized information about objects that fall inside a query rectangle (e.g., the number of objects instead of their concrete ids). Tradi...
Yufei Tao, Dimitris Papadias, Jun Zhang
136
Voted
DPD
2002
168views more  DPD 2002»
15 years 1 months ago
Evolutionary Algorithms for Allocating Data in Distributed Database Systems
A major cost in executing queries in a distributed database system is the data transfer cost incurred in transferring relations (fragments) accessed by a query from different sites...
Ishfaq Ahmad, Kamalakar Karlapalem, Yu-Kwong Kwok,...
DEXA
2003
Springer
162views Database» more  DEXA 2003»
15 years 7 months ago
Dynamic Splitting Policies of the Adaptive 3DR-Tree for Indexing Continuously Moving Objects
Moving-objects databases need a spatio-temporal indexing scheme for moving objects to efficiently process queries over continuously changing locations of the objects. A simple exte...
Bonggi Jun, Bonghee Hong, Byunggu Yu
DASFAA
2004
IEEE
158views Database» more  DASFAA 2004»
15 years 5 months ago
A Cost Model for Spatial Intersection Queries on RI-Trees
Abstract. The efficient management of interval sequences represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tr...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...