Sciweavers

664 search results - page 26 / 133
» Generalized Search Trees for Database Systems
Sort
View
SODA
2010
ACM
196views Algorithms» more  SODA 2010»
16 years 1 months ago
Deletion Without Rebalancing in Balanced Binary Trees
We address the vexing issue of deletions in balanced trees. Rebalancing after a deletion is generally more complicated than rebalancing after an insertion. Textbooks neglect delet...
Siddhartha Sen, Robert E. Tarjan
DEXA
2009
Springer
124views Database» more  DEXA 2009»
15 years 11 months ago
VisiNav: Visual Web Data Search and Navigation
Semantic Web technologies facilitate data integration over a large number of sources with decentralised and loose coordination, ideally leading to interlinked datasets which descri...
Andreas Harth
KDD
2006
ACM
208views Data Mining» more  KDD 2006»
16 years 4 months ago
Frequent subgraph mining in outerplanar graphs
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
Tamás Horváth, Jan Ramon, Stefan Wro...
ICDE
2008
IEEE
241views Database» more  ICDE 2008»
16 years 5 months ago
PictureBook: A Text-and-Image Summary System for Web Search Result
Search engine technology plays an important role in Web information retrieval. However, with Internet information explosion, traditional searching techniques cannot provide satisfa...
Baile Shi, Guoyu Hao, Hongtao Xu, Mei Wang, Qi Zha...
SIGMOD
2008
ACM
127views Database» more  SIGMOD 2008»
15 years 4 months ago
Minimization of tree pattern queries with constraints
Tree pattern queries (TPQs) provide a natural and easy formalism to query tree-structured XML data, and the efficient processing of such queries has attracted a lot of attention. ...
Ding Chen, Chee Yong Chan