Sciweavers

2889 search results - page 303 / 578
» Querying Structured Hyperdocuments
Sort
View
SIGMOD
2009
ACM
220views Database» more  SIGMOD 2009»
16 years 6 months ago
Keyword search in databases: the power of RDBMS
Keyword search in relational databases (RDBs) has been extensively studied recently. A keyword search (or a keyword query) in RDBs is specified by a set of keywords to explore the...
Lu Qin, Jeffrey Xu Yu, Lijun Chang
WWW
2006
ACM
16 years 6 months ago
Symmetrically exploiting XML
Path expressions are the principal means of locating data in a hierarchical model. But path expressions are brittle because they often depend on the structure of data and break if...
Shuohao Zhang, Curtis E. Dyreson
ICALP
2009
Springer
16 years 6 months ago
B-Treaps: A Uniquely Represented Alternative to B-Trees
We present the first uniquely represented data structure for an external memory model of computation, a B-tree analogue called a B-treap. Uniquely represented data structures repre...
Daniel Golovin
SIGMOD
2002
ACM
124views Database» more  SIGMOD 2002»
16 years 6 months ago
Quadtree and R-tree indexes in oracle spatial: a comparison using GIS data
Spatial indexing has been one of the active focus areas in recent database research. Several variants of Quadtree and R-tree indexes have been proposed in database literature. In ...
Kothuri Venkata Ravi Kanth, Siva Ravada, Daniel Ab...
WEA
2007
Springer
104views Algorithms» more  WEA 2007»
16 years 8 days ago
Dynamic Trees in Practice
Dynamic tree data structures maintain forests that change over time through edge insertions and deletions. Besides maintaining connectivity information in logarithmic time, they ca...
Robert Endre Tarjan, Renato Fonseca F. Werneck