MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for authors named "Panayiotis Bozanis" – sorted by Relevance.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 6 documents found, showing 1 through 6.
ATOM RSS
  • LDT: a Logarithmic Distributed Search  
  • by Panayiotis Bozanis, Yannis Manolopoulos — 2002
  • …We propose LDT, a new Scalable Distributed Search Tree for the dictionary problem, as an alternative to both random trees and deterministic height balanced trees. Our scheme exhibits logarithmic update time, either constant or logarithmic search time for single key queries and output sensitive query…
  • Add To MetaCart
  • DSL: Accommodating Skip Lists in the SDDS Model  
  • by Panayiotis Bozanis, Yannis Manolopoulos — 2000 — Carleton Scientific
  • …We propose DSL, a new Scalable Distributed Data Structure for the dictionary problem, based on a version of Skip Lists, as an alternative to both random trees and deterministic height balanced trees. Our scheme exhibits, with high probability, logarithmic search time, constant reconstruction time…
  • Cited by 1 (1 self)Add To MetaCart
  • Categorical Range Queries in Large Databases  
  • by Alexandros Nanopoulos, Ros Nanopoulos, Panayiotis Bozanis — 2003 — In SSTD’03, LNCS 2750
  • …In this pape r e int r duce the categor214 (a.k.a. chr omatic) r) ge quer2L (CRQs) in the context oflar1P disk-r esident data sets, motivated by the fact that CRQsar conceptually simple and emer4 often in DBMSs. On the basis of spatial data str uctur3N and R-tr4L in par ticular e p r pose a multi-tr…
  • Cited by 1 (0 self)Add To MetaCart
  • LR-tree: a Logarithmic Decomposable Spatial Index Method  
  • by Panayiotis Bozanis, Alexandros Nanopoulos, Yannis Manolopoulos — 2003
  • …this paper, we present LR-trees, a new efficient scheme for dynamic manipulation of large datasets, which combines the search performance of the bulkloaded R-trees with the updated performance of R # -trees. Experimental results provide evidence on the latter statement and illustrate the superior…
  • Cited by 2 (1 self)Add To MetaCart
  • Signature-based Structures for Objects with Set-valued Attributes  
  • by Eleni Tousidou, Panayiotis Bozanis, Yannis Manolopoulos — 2002
  • …Aiming at the efficient retrieval of objects with set-valued attributes, we introduce three variations of a new method in order to satisfy subset and superset queries. Our approach is to combine the advantages of two access methods, that of linear Hashing and of tree-shaped methods, on which other s…
  • Cited by 6 (1 self)Add To MetaCart
Help! Showing 1 through 6.
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB