Sciweavers

3020 search results - page 146 / 604
» Similarity Queries on Structured Data in Structured Overlays
Sort
View
SODA
2010
ACM
174views Algorithms» more  SODA 2010»
15 years 4 months ago
Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs
Several existing cache-oblivious dynamic dictionaries achieve O(logB N) (or slightly better O(logB N M )) memory transfers per operation, where N is the number of items stored, M ...
Gerth Stølting Brodal, Erik D. Demaine, Jer...
NOMS
2008
IEEE
139views Communications» more  NOMS 2008»
16 years 28 days ago
Fast similarity search in peer-to-peer networks
Abstract—Peer-to-peer (P2P) systems show numerous advantages over centralized systems, such as load balancing, scalability, and fault tolerance, and they require certain function...
Thomas Bocek, Ela Hunt, David Hausheer, Burkhard S...
CIKM
2008
Springer
15 years 8 months ago
A heuristic approach for checking containment of generalized tree-pattern queries
Query processing techniques for XML data have focused mainly on tree-pattern queries (TPQs). However, the need for querying XML data sources whose structure is very complex or not...
Pawel Placek, Dimitri Theodoratos, Stefanos Soulda...
ICDE
2006
IEEE
136views Database» more  ICDE 2006»
16 years 8 months ago
XCluster Synopses for Structured XML Content
We tackle the difficult problem of summarizing the path/branching structure and value content of an XML database that comprises both numeric and textual values. We introduce a nov...
Neoklis Polyzotis, Minos N. Garofalakis
KDD
2005
ACM
162views Data Mining» more  KDD 2005»
16 years 7 months ago
Discovering frequent topological structures from graph datasets
The problem of finding frequent patterns from graph-based datasets is an important one that finds applications in drug discovery, protein structure analysis, XML querying, and soc...
Ruoming Jin, Chao Wang, Dmitrii Polshakov, Sriniva...