MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for authors named "Nikos Mamoulis" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 59 documents found, showing 1 through 10. Next 10 →
ATOM RSS
  • Multiway Spatial Joins  
  • by Nikos Mamoulis — 2001 — ACM Transactions on Database Systems (TODS
  • …Due to the evolution of Geographical Information Systems, large collections of spatial data having various thematic contents are currently available. As a result, the interest of users is not limited to simple spatial selections and joins, but complex query types that implicate numerous spatial inpu…
  • Cited by 23 (7 self) – Add To MetaCart
  • Constraint-based Algorithms for Computing Clique Intersection Joins  
  • by Nikos Mamoulis — 1998 — Proc. ACM-GIS
  • …Spatial joins constitute one of the most active research topics in spatial query processing. This paper deals with the processing of clique intersection joins using R-trees. A clique intersection join will retrieve all n-tuples of objects that pair-wise overlap. The corresponding MBR-based filter st…
  • Cited by 4 (1 self) – Add To MetaCart
  • Slot Index Spatial Join  
  • by Nikos Mamoulis, Dimitris Papadias — 2003 — IEEE Transactions on Knowledge and Data Engineering
  • …Abstract—Efficient processing of spatial joins is very important due to their high cost and frequent application in spatial databases and other areas involving multidimensional data. This paper proposes slot index spatial join (SISJ), an algorithm that joins a nonindexed data set with one indexed by…
  • Cited by 14 (2 self) – Add To MetaCart
  • K.: Constraint satisfaction in semi-structured data graphs  
  • by Nikos Mamoulis, Kostas Stergiou — 2004 — CP. Volume 3258 of Lecture Notes in Computer Science
  • …Abstract. XML data can be modeled as node-labeled graphs and XML queries can be expressed by structural relationships between labeled elements. XML query evaluation has been addressed using mainly database, and in some cases graph search, techniques. We propose an alternative method that models and …
  • Cited by 3 (0 self) – Add To MetaCart
  • Integration of Spatial Join Algorithms for Processing Multiple Inputs  
  • by Nikos Mamoulis, Dimitris Papadias — 1999
  • …Several techniques that compute the join between two spatial datasets have been proposed during the last decade. Among these methods, some consider existing indices for the joined inputs, while others treat datasets with no index, providing solutions for the case where at least one input comes as an…
  • Cited by 37 (13 self) – Add To MetaCart
  • Integration of Spatial Join Algorithms for Joining Multiple Inputs  
  • by Nikos Mamoulis, Dimitris Papadias — 1998
  • …Several techniques that compute the join between two spatial datasets have been proposed during the last decade. Among these methods, some consider existing indices for the joined inputs, while others treat datasets with no index, thus providing solutions for the case where at least one input comes …
  • Cited by 8 (1 self) – Add To MetaCart
  • Solving Non-binary CSPs Using the Hidden Variable Encoding  
  • by Nikos Mamoulis, Kostas Stergiou — 2001 — Proccedings of CP 2001, LNCS 2239
  • …Non-binary constraint satisfactionproblfa (CSPs) can be sol ed in two di#erent ways. We can eithertranslzfi theproblH into an equivali t binary one and sol e it using welE7Vo#fiR6V7ol binary CSP techniques or use extended versions of binary techniques directl on the non-binaryproblin Recentl , it ha…
  • Cited by 4 (2 self) – Add To MetaCart
  • Algorithms for quantified constraint satisfaction problems  
  • by Nikos Mamoulis, Kostas Stergiou — 2004 — In Proceedings of CP-2004
  • …Abstract. Many propagation and search algorithms have been developed for constraint satisfaction problems (CSPs). In a standard CSP all variables are existentially quantified. The CSP formalism can be extended to allow universally quantified variables, in which case the complexity of the basic reaso…
  • Cited by 12 (2 self) – Add To MetaCart
  • Selectivity Estimation of Complex Spatial Queries  
  • by Nikos Mamoulis, Dimitris Papadias — 2001 — In Advances in Spatial and Temporal Databases : 7th International Symposium, SSTD
  • …. Several studies have focused on the efficient processing of simple spatial query types such as selections and spatial joins. Little work, however, has been done towards the optimization of queries that process several spatial inputs and combine them through join and selection conditions. This p…
  • Cited by 9 (1 self) – Add To MetaCart
  • One-Pass Wavelet Synopses for Maximum-Error Metrics  
  • by Panagiotis Karras, Nikos Mamoulis — 2005
  • …We study the problem of computing waveletbased synopses for massive data sets in static and streaming environments. A compact representation of a data set is obtained after a thresholding process is applied on the coefficients of its wavelet decomposition. Existing polynomial-time thresholding schem…
  • Cited by 12 (3 self) – Add To MetaCart
Help! Showing 1 through 10. Next 10 →
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB