Sciweavers

568 search results - page 71 / 114
» Query by table
Sort
View
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
15 years 3 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
DASFAA
2006
IEEE
111views Database» more  DASFAA 2006»
15 years 3 months ago
Holistic Schema Mappings for XML-on-RDBMS
When hosting XML information on relational backends, a mapping has to be established between the schemas of the information source and the target storage repositories. A rich body ...
Priti Patil, Jayant R. Haritsa
COMAD
2008
14 years 11 months ago
Native Multidimensional Indexing in Relational Databases
In existing database systems there is a strong need for searching data according to many attributes. In commercial database platforms, the standard search over multiple attributes...
David Hoksza, Tomás Skopal
HOTOS
2007
IEEE
15 years 1 months ago
Hyperspaces for Object Clustering and Approximate Matching in Peer-to-Peer Overlays
Existing distributed hash tables provide efficient mechanisms for storing and retrieving a data item based on an exact key, but are unsuitable when the search key is similar, but ...
Bernard Wong, Ymir Vigfusson, Emin Gün Sirer
EDBT
2009
ACM
156views Database» more  EDBT 2009»
15 years 2 months ago
Secondary bitmap indexes with vertical and horizontal partitioning
Traditional bitmap indexes are utilized as a special type of primary or clustered indexes where the queries are answered by performing fast logical operations supported by hardwar...
Guadalupe Canahuate, Tan Apaydin, Ahmet Sacan, Hak...