(PDF) Arcane Art - Some Thoughts On The Perception Of The Magico ...

Log InSign Up

• Log In
• Sign Up
• more
• • About
  • Press
  • Papers
  • Terms
  • Privacy
  • Copyright
  • We're Hiring!
  • Help Center
  • less

Outline

keyboard_arrow_downTitleAbstractKey TakeawaysIntroductionConclusionReferencesFAQsAll TopicsHistoryAncient Historydownload

Download Free PDF

Download Free PDFArcane Art - Some thoughts on the Perception of the Magico-Religious Imagery of Lamaštu-AmuletsEva Götting-Martin

2017, Proceedings of the 10th International Congress on the Archaeology of the Ancient Near East, Luciani, M. et al. (eds))

https://doi.org/10.2307/J.CTVCM4F86.39visibility

…

description

26 pages

descriptionSee full PDFdownloadDownload PDF bookmarkSave to LibraryshareShareclose

Sign up for access to the world's latest research

Sign up for freearrow_forwardcheckGet notified about relevant paperscheckSave papers to use in your researchcheckJoin the discussion with peerscheckTrack your impact

Abstract

Lamaštu is known as a baby-snatching demon that attacks especially children and pregnant women but also men and cattle. Rituals and apotropaic amulets were used in Mesopotamia, Anatolia and the Levant to protect persons and animals from this malevolent demon. These amulets were canonized in Assyria during the 1st millennium BCE. As a result, elaborated amulets depicting Lamaštu herself and several Zwischenwesen (urigallū, ugallu and lulal, apkallu and Pazuzu), as well as the afflicted patient and the āšipu-priest were created. This paper aims to examine the congruency between iconographic narrative and performed ritual. Furthermore, the visual perception of the magico-religious imagery of the amulets will be examined by identifying the agents and recipients of the pictorial message. By untangling the levels of visual communication and embedding them into ritual context, some light is to be shed on one of the most intriguing subjects in the ‘Arcane Arts’ of Mesopotamia.

... Read more

Key takeaways

AI

1. The paper explores the ritual significance and iconography of Lamaštu amulets in ancient Mesopotamia.
2. Lamaštu is depicted with a hybrid form, representing various malevolent traits and protective powers.
3. Canonization of Lamaštu imagery occurred during the 1st millennium BCE, influencing ritual practices across regions.
4. The amulets serve dual functions: protective talismans and ritualistic tools embodying exorcistic narratives.
5. The visual communication of the amulets engages both human and divine agents, influencing the ritual context.

Related papers

Spatial joins using seeded treesML Lo

ACM SIGMOD Record, 1994

Existing methods for spatial joins assume the existence of indices for the participating data sets. This assumption is not realistic for applications involving multiple map layer overlays or for queries involving non-spatial selections. In this paper, we explore a spatiaJ join method that dynamically constructs index trees called seeded trees at join time. This method uses knowledge of thedata sets involved in the join to speed up the join process. Seeded trees are R-tree-like structures, and are divided into the seed levels and the grown levels. The nodes in the seed levels are used to guide tree growth during tree construction. The seed levels can also be used to filter out some input data during construction, thereby reducing tree size. We develop a technique that uses intermediate linked lists during tree construction and significantly speeds up the tree construction process. The technique allows a large number of random disk accesses during tree construction to be replaced by smsller numbers of sequential accesses. Our performance studies show that spatial joins using seeded trees outperform those using other methods significantly in terms of disk 1/0. The CPU penalties incurred are also lower except when seed-level filtering is used.

downloadDownload free PDFView PDFchevron_rightBenchmarking spatial joins a la carteJ.Marc Saglio, Vincent Oria

International Journal of Geographical Information Science, 1999

Spatial joins are join operations that involve spatial data types and operators. Spatial access methods are often used to speed up the computation of spatial joins. This paper addresses the issue of benchmarking spatial join operations. For this purpose, we first present a WWW-based benchmark generator to produce sets of rectangles. Using a Web browser, experimenters can specify the number of rectangles in a sample, as well as the statistical distributions of their sizes, shapes, and locations. Second, using the generator and a well-defined set of statistical models we define several tests to compare the performance of three spatial join algorithms: nested loop, scan-and-index, and synchronized tree traversal. We also added a real-life data set from the Sequoia 2000 storage benchmark. Our results show that the relative performance of the different techniques mainly depends on two parameters: sample size, and selectivity of the join predicate. All of the statistical models and algorithms are available on the Web, which allows for easy verification and modification of our experiments.

downloadDownload free PDFView PDFchevron_rightA Learned Query Optimizer for Spatial JoinSara Migliorini

Proceedings of the 29th International Conference on Advances in Geographic Information Systems, 2021

The importance and complexity of spatial join resulted in many join algorithms, some of which run on big-data platforms such as Hadoop and Spark. This paper proposes the first machine-learningbased query optimizer for spatial join operation which can accommodate the skewness of the spatial datasets and the complexity of the different algorithms. The main challenge is how to develop portable cost models that take into account the important input characteristics such as data distribution, spatial partitioning, logic of spatial join algorithms, and the relationship between the two datasets. The proposed system defines a set of features that can all be computed efficiently for the data to catch the intricate aspects of spatial join. Then, it uses these features to train three machine learning models that capture several metrics to estimate the cost of four spatial join algorithms according to user requirements. The first model can estimate the cardinality of spatial join algorithm. The second model can predict the number of rough comparisons for a specific join algorithm. Finally, the third model is a classification model that can choose the best join algorithm to run. Experiments on large scale synthetic and real data show the efficiency of the proposed models over baseline methods. CCS CONCEPTS • Information systems → Database management system engines; • Computing methodologies → Machine learning approaches.

downloadDownload free PDFView PDFchevron_rightQuery optimizer for spatial join operationsJoao Comba

2006

Abstract This paper presents a query optimizer module based on cost estimation that chooses the best filtering step algorithm to perform a specific spatial join operation. A set of expressions to predict the number of I/O operations and the response time of each algorithm is first presented and later refined considering a given hardware configuration. The query optimizer chooses the algorithm that returns the smaller estimated response time.

downloadDownload free PDFView PDFchevron_rightSpatial join for high-resolution objectsMatthias Renz

Proceedings. 16th International Conference on Scientific and Statistical Database Management, 2004., 2004

Modern database applications including computer-aided design (CAD), medical imaging, molecular biology, or Multimedia Information Systems impose new requirements on efficient spatial query processing. One of the most common query types in Spatial Database Management Systems is the spatial join. In this paper, we investigate spatial join processing for two sets of very complex spatial objects. We present an approach that is based on a fast filter step performing the spatial join on simple primitives which conservatively approximate the objects. Our main attention is focused on the problem how to generate approximations adequate for high-resolution objects. In this paper, we introduce gray approximations as a general concept which helps to range between replicating and non-replicating object approximations. The key idea of our approach is to build these replications based on statistical information taking the data distribution of the respective join-partner relation into account. Furthermore, our approach uses compression techniques for the effective storage and retrieval of the decomposed spatial objects. We demonstrate the benefits of our new method for the spatial intersection join on high resolution data. The experimental evaluation on real-world test data points out that our new concept accelerates the spatial intersection join considerably.

downloadDownload free PDFView PDFchevron_rightProcessing and optimization of multiway spatial joins using R-treesYannis Theodoridis

1999

One of the most important types of query processing in spatial databases and geographic information systems is the spatial join, an operation that selects, from two relations, all object pairs satisfying some spatial predicate. A multiway join combines data originated from more than two relations. Although several techniques have been proposed for pairwise spatial joins, only limited work has focused on multiway spatial join processing. This paper solves multiway spatial joins by applying systematic search algorithms that exploit R-trees to efficiently guide search, without building temporary indexes or materializing intermediate results. In addition to general methodologies, we propose cost models and an optimization algorithm, and evaluate them through extensive experimentation.

downloadDownload free PDFView PDFchevron_rightAn Efficient Cost Model for Spatial Joins Using R-treesDS 15

IEEE Transactions on Knowledge and Data Engineering, 1997

Spatial join is one of the fundamental operations in a Spatial Data Base Management System. Recently, the family of R-tree-based data structures has been adopted to support the execution of spatial joins. This paper introduces an analytical model that efficiently estimates the cost (in terms of disk accesses) of a spatial join query between two spatial datasets. The proposed model is based on an analytical formula that estimates the cost of the range query using Rtrees. In addition, comparison results are presented which show the accuracy of the analytical estimations when compared to actual tests on both synthetic and real datasets. It turns out that the relative error rarely exceeds 15% for all combinations.

downloadDownload free PDFView PDFchevron_rightPipelined spatial join processing for quadtree-based indexesWalid Aref

Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems - GIS '07, 2007

Spatial join is an important yet costly operation in spatial databases. In order to speed up the execution of a spatial join, the input tables are often indexed based on their spatial attributes. The quadtree index structure is a well-known index for organizing spatial database objects. It has been implemented in several database management systems, e.g., in Oracle Spatial and in PostgreSQL (via SP-GiST). Queries typically involve multiple pipelined spatial join operators that fit together in a query evaluation plan. In order to extend the applicability of these spatial joins, they are optimized so that upon receiving sorted input, they produce sorted output for the spatial join operators in the upperlevels of the query evaluation pipeline. This paper investigates the use of quadtree-based spatial join algorithms and how they can be adapted to answer queries that involve multiple pipelined spatial joins in a query evaluation plan. The paper investigates several adaptations to pipelined spatial join algorithms and their performance for the cases when both input tables are indexed, when only one of the tables is indexed while the second table is sorted, and when both tables are sorted but are not indexed.

downloadDownload free PDFView PDFchevron_rightSearch algorithms for multiway spatial joinsDinos Arkoumanis

International Journal of Geographical Information Science, 2002

This papers deals with multiway spatial joins when (i) there is limited time for query processing and the goal is to retrieve the best possible solutions within this limit (ii) there is unlimited time and the goal is to retrieve a single exact solution, if such a solution exists, or the best approximate one otherwise. The first case is motivated by the high cost of join processing in real-time systems involving large amounts of multimedia data, while the second one is motivated by applications that require "negative" examples. We propose several search algorithms for query processing under theses conditions. For the limited-time case we develop some non-deterministic search heuristics that can quickly retrieve good solutions. However, these heuristics are not guaranteed to find the best solutions, even without a time limit. Therefore, for the unlimited-time case we describe systematic search algorithms tailored specifically for the efficient retrieval of a single solution. Both types of algorithms are integrated with R-trees in order to prune the search space. Our proposal is evaluated with extensive experimental comparison.

downloadDownload free PDFView PDFchevron_rightA learning-based framework for spatial join processing: estimation, optimization and tuningSara Migliorini

˜The œVLDB journal, 2024

The importance and complexity of spatial join operation resulted in the availability of many join algorithms, some of which are tailored for big-data platforms like Hadoop and Spark. The choice among them is not trivial and depends on different factors. This paper proposes the first machine-learning-based framework for spatial join query optimization which can accommodate both the characteristics of spatial datasets and the complexity of the different algorithms. The main challenge is how to develop portable cost models that once trained can be applied to any pair of input datasets, because they are able to extract the important input characteristics, such as data distribution and spatial partitioning, the logic of spatial join algorithms, and the relationship between the two input datasets. The proposed system defines a set of features that can be computed efficiently for the data to catch the intricate aspects of spatial join. Then, it uses these features to train five machine learning models that are used to identify the best spatial join algorithm. The first two are regression models that estimate two important measures of the spatial join performance and they act as the cost model. The third model chooses the best partitioning strategy to use with spatial join. The fourth and fifth models further tune two important parameters, number of partitions and plane-sweep direction, to get the best performance. Experiments on large-scale synthetic and real data show the efficiency of the proposed models over baseline methods.

downloadDownload free PDFView PDFchevron_rightSee full PDFdownloadDownload PDF

Loading Preview

Sorry, preview is currently unavailable. You can download the paper by clicking the button above.

References (40)

1. Bahrani, Z. 2003 The Graven Image. Representation in Babylonia and Assyria. Philadelphia. Belting, H. 1990 Bild und Kult -eine Geschichte des Bildes vor dem Zeitalter der Kunst, München.
2. van Binsbergen, W. and Wiggermann, F. A. M. 1999 Magic in history. A theoretical perspective, and its application to ancient Mesopotamia. In: T. Abusch and K. Van der Toorn (eds.), Mesopotamian Magic. Ancient Magic and Divination 1, Groningen.
3. Dick, M. B. and Walker, C. B. F. 2001 The Induction of the Cult Image: The Mesopotamian Mīs Pî Ritual. The Neo-Assyrian Text Corpus Project. Winona Lake, Ind.
4. Didi-Huberman, G. 1985 La peinture incarnée, Paris.
5. Dunham, S. 1993 Beads for babies. Zeitschrift für Assyriologie 83, 237-257.
6. van Eck, C. 2010 Living statues: Alfred Gell's art and agency, living presence response and the sublime, Art History 33/4, 662-680.
7. 2015 Art, Agency and Living Presence: from the Animated Image to the Excessive Object. München -Leiden.
8. Eichmann, R. 1997
9. Ein Hund, ein Schwein, ein Musikant. In: B. Pongratz-Leisten, H. Kühne and P. Xella (eds.), Ana šadê Labnāni lū allik. Beiträge zu altorientalischen und mittelmeerischen Kulturen. Fest- schrift für Wolfgang Röllig. Alter Orient und Altes Testament 247, Kevelaer -Neukirchen - Vluyn, 97-108.
10. Farber, W. 1983
11. Art. Lamaštu, Reallexikon der Assyriologie und Vorderasiatischen Archäologie 6, 439-446. 1987
12. Tamarisken, Fibeln, Skolopender. Zur philologischen Deutung der 'Reiseszene' auf neuassy- rischen Lamaštu-Amuletten. In: F. Rochberg-Halton (ed.), Language, Literature, and History: Philological and Historical Studies Presented to Erica Reiner. American Oriental Society 67. New Haven, 85-105.
13. 1989 Dämonen ohne Stammbaum. Zu einigen mesopotamischen Amuletten aus dem Kunsthandel. In: A. Leonard Jr. and B. B. Williams (eds.), Essays in Ancient Civilization Presented to Helene J. Kantor. Studies in Ancient Oriental Civilization 47. Chicago, 93-108.
14. 1997 ištu api ilâmma ezēzu ezzet. Ein bedeutsames neues Lamaštu-Amulett. In: B. Pongratz-Leis- ten, H. Kühne and P. Xella (eds.), Ana šadê Labnāni lū allik. Beiträge zu altorientalischen und mittelmeerischen Kulturen. Festschrift für Wolfgang Röllig. Alter Orient und Altes Testament 247. Kevelaer -Neukirchen -Vluyn, 115-128.
15. 2007 Lamaštu -agent of a specific disease or a generic destroyer of health? In: I. Finkel and M. Geller (eds.), Diseases in Babylonia. Cuneiform Monographs 36. Leiden -Boston, 137-145.
16. 2014 Lamaštu. An Edition of the Canonical Series of Lamaštu Incantations and Rituals and Related Texts from the Second and First Millennia B.C. Mesopotamian Civilizations 17. Winona Lake.
17. Freedberg, D. 1989 The Power of Images: Studies in the History and Theory of Response, Chicago -London.
18. Gell, A. 1998 Art and Agency. An Anthropological Theory. Oxford.
19. Götting, E. 2009
20. Lamaštu -Ikonographie einer altorientalischen Dämonin. MA thesis, Freie Univerität Berlin. Berlin. 2011 Exportschlager Dämon? Zur Verbreitung altorientalischer Lamaštu-Amulette, In: J. Göbel (ed.), Humboldts Studentische Konferenz der Altertumswissenschaften, Exportschlager, 2009. Berlin, 437-456.
21. forthcoming Art. Lamaštu, iconography of deities and demons. In: C. Uehlinger (ed.), Iconography of Deities and Demons in the Ancient Near East (IDD), Orbis Biblicus et Orientalis, forthcoming.
22. Götting, E. and Panayotov, S. forthcoming Lamaštu and Hulbazizi Amulets -Iconography and Inscriptions. Ancient Medicine and Divination. Leiden.
23. Haas, V. 2003 Materia magica et medica hethitica: ein Beitrag zur Heilkunde im alten Orient, Volume 1. Berlin. Heeßel, N. P. 2002 Pazuzu. Archäologische und philologische Studien zu einem altorientalischen Dämon. Ancient Magic and Divination 4. Leiden.
24. 2014 Amulette und Amulettform: Zum Zusammenhang von Form, Funktion und Text von Amuletten im Alten Mesopotamien. In: J. F. Quack und D. C. Luft (eds.), Erscheinungsformen und Hand- habungen heiliger Schriften. Materielle Textkulturen 5. Berlin -München -Boston, 53-77.
25. Jean, C. 2006 La magie néo-assyrienne en contexte: Recherches sur le métier d'exorciste et le concept d'aši- putu, State Archives of Assyria Studies 17. Neo-Assyrian Text Corpus Project, Helsinki.
26. Kaelin, O. 2007 Pazuzu, Lamaschtu-Reliefs and Horus-Stelen. In: S. Bickel, S. Schroer, R. Schurte and C. Uehlinger (eds.), Bilder als Quellen. Images as Sources. Studies on Ancient Near Eastern Artifacts and the Bible Inspired by the Work of Othmar Keel, Fribourg -Göttingen, 365-378.
27. Luck, G. 2006 Magic and the Occult in the Greek and Roman Worlds: A Collection of Ancient Texts. Balti- more.
28. Mitchell, W. 2005 What do Pictures Want? The Lives and Loves of Images. Chicago -London.
29. Myhrman, D. W. 1902 Die Labartu-Texte, babylonische Beschwörungsformeln gegen die Dämonin Labartu, Zeit- schrift für Assyriologie 16, 141-200.
30. Panayotov, S.
31. Die Lampe am Krankenbett. Untersuchungen zu altorientalischen Gebeten an den Lichtgott Nuska. Cuneiform Digital Library Preprints 4, 2016. Nanterre.
32. Piccioni, S. A. 1981 Il Poemetto di Adapa. Budapest.
33. Ritter, E. F. 1965 Magical-expert (āšipu) and physician (asû): Notes on two complementary professions in Babylo- nian medicine. In: H. G. Güterbock and T. Jacobsen (eds.), Studies in Honor of Benno Landsber- ger on his Seventy-fifth Birthday, April 21 1965, Assyriological Studies 16. Chicago, 299-322.
34. Thureau-Dangin, F. 1921 Rituel et amulettes contre Labartu. Revue Assyriologique 18, 161-198.
35. Warner, M. 2006 Phantasmagoria. Spirit Visions, Metaphors and Media into the Twenty-First Century. Oxford. Watanabe, C. E. 2004 The 'continuous style' in the narrative scheme of Assurbanipal's reliefs. Iraq 66, 103-114.
36. Wickhoff, F. 1912
37. Römische Kunst (Die Wiener Genesis), Berlin.
38. Wiggermann, F. A. M. 1992 Mesopotamian Protective Spirits. Cuneiform Monographs 1. Groningen. 2000
39. Lamaštu, daughter of Anu. A profile. In: M. Stol and F. A. M. Wiggermann (eds.), Birth in Babylonia and the Bible. Its Mediterranean Setting. Cuneiform Monographs 14. Groningen, 217-252. 2007 Some demons of time and their functions in Mesopotamian iconography. In: B. Groneberg and H. Spieckermann (eds.), Die Welt der Götterbilder. New York -Berlin.
40. 2010 Dogs, pigs, Lamaštu, and the breast-feeding of animals by women. In: D. Shehata, F. Weierhäu- ser and K. V. Zand (eds.), Von Göttern und Menschen, Beiträge zu Literatur und Geschichte des Alten Orients. Festschrift für Brigitte Groneberg. Cuneiform Monographs 41. Leiden -Boston, 407-412.

View morearrow_downward

FAQs

AI

How did the iconographic portrayal of Lamaštu evolve over time?add

The study reveals that Lamaštu's iconography was canonized in the 1st millennium BCE, demonstrating a shift from variable representations in earlier amulets. By this period, she is consistently depicted with a lion's head, human chest, and bird-like feet, indicating a standardized iconographic form.

What role do the rituals play in the use of Lamaštu amulets?add

The research shows that Lamaštu amulets were integral to exorcistic rituals, acting as physical manifestations of the ritual context. Each amulet’s imagery corresponds directly with the incantations used during the exorcisms, ensuring their ritual effectiveness.

What explains the significance of the number seven in Lamaštu amulets?add

The presence of seven urigallū-demons on the amulets likely correlates with the seven names of Lamaštu mentioned in the incantations. This association highlights the number's commonality as a magical figure in Mesopotamian religious texts.

When was the first evidence of Lamaštu amulets discovered?add

The earliest Lamaštu amulets date to the late 2nd millennium BCE, likely originating from Babylonia. These initial amulets showcase a developing iconography that laid the groundwork for later, more codified representations.

What methodologies were employed to analyze the perception of Lamaštu imagery?add

The paper employs A. Gell's theory of Art and Agency to investigate the social dynamics between the amulets and their viewers. This approach facilitates an understanding of the multi-directional communication among the priest, afflicted, and transcendental agencies.

Related papers

Transform-Space View: Performing Spatial Join in the Transform Space Using Original-Space IndexesWook-Shin Han

IEEE Transactions on Knowledge and Data Engineering, 2006

Spatial joins find all pairs of objects that satisfy a given spatial relationship. In spatial joins using indexes, original-space indexes such as the R-tree are widely used. An original-space index is the one that indexes objects as represented in the original space. Since original-space indexes deal with extents of objects, it is relatively complex to optimize join algorithms using these indexes. On the other hand, transform-space indexes, which transform objects in the original space into points in the transform space and index them, deal only with points but no extents. Thus, optimization of join algorithms using these indexes can be relatively simple. However, the disadvantage of these join algorithms is that they cannot be applied to original-space indexes such as the R-tree. In this paper, we present a novel mechanism for achieving the best of these two types of algorithms. Specifically, we propose the new notion of the transform-space view and present the transform-space view join algorithm. The transform-space view is a virtual transform-space index based on an original-space index. It allows us to "interpret" or "view" an existing original-space index as a transform-space index with no space and negligible time overhead and without actually modifying the structure of the original-space index or changing object representation. The transform-space view join algorithm joins two original-space indexes in the transform space through the notion of the transform-space view. Through analysis and experiments, we verify the excellence of the transform-space view join algorithm. The transform-space view join algorithm always outperforms existing ones for all the data sets tested in terms of all three measures used: the one-pass buffer size (the minimum buffer size required for guaranteeing one disk access per page), the number of disk accesses for a given buffer size, and the wall clock time. Thus, it constitutes a lower-bound algorithm. We believe that the proposed transform-space view can be applied to developing various new spatial query processing algorithms in the transform space.

downloadDownload free PDFView PDFchevron_rightAdaptive row major order: a new space filling curve for efficient spatial join processing in the transform spaceWook-Shin Han

Journal of Systems and Software, 2005

A transform-space index indexes spatial objects represented as points in the transform space. An advantage of a transform-space index is that optimization of spatial join algorithms using these indexes can be more formal. The authors earlier proposed the Transform-Based Spatial Join algorithm that joins two transform-space indexes. It renders global optimization easy with little overhead by utilizing the characteristics of the transform space. In particular, it allows us to globally determine the order of accessing disk pages, which makes a significant impact on the performance of joins. For this purpose, we use various space filling curves. In this paper, we propose a new space filling curve called the adaptive row major order (ARM order). The ARM order adaptively controls the order of accessing pages and significantly reduces the one-pass buffer size (the minimum buffer size required for guaranteeing one disk access per page) and the number of disk accesses for a given buffer size. Through analysis and experiments, we verify excellence of the ARM order when used with the Transform-Based Spatial Join. The Transform-Based Spatial Join with the ARM order always outperforms those with other conventional space filling curves in terms of both measures used: the one-pass buffer size and the number of disk accesses. Specifically, it reduces the one-pass buffer size by up to 25.9 times and the number of disk accesses by up to 2.11 times. We conclude that we achieve these results mainly due to global optimization of the order of accessing disk pages using an adaptive space filling curve.

downloadDownload free PDFView PDFchevron_rightEfficient processing of spatial joins with DOT-based indexingSang-wook Kim

Information Sciences, 2010

A spatial join is a query that searches for a set of object pairs satisfying a given spatial relationship from a database. It is one of the most costly queries, and thus requires an efficient processing algorithm that fully exploits the features of the underlying spatial indexes. In our earlier work, we devised a fairly effective algorithm for processing spatial joins with double transformation (DOT) indexing, which is one of several spatial indexing schemes. However, the algorithm is restricted to only the one-dimensional cases. In this paper, we extend the algorithm for the two-dimensional cases, which are general in Geographic Information Systems (GIS) applications. We first extend DOT to two-dimensional original space. Next, we propose an efficient algorithm for processing range queries using extended DOT. This algorithm employs the quarter division technique and the tri-quarter division technique devised by analyzing the regularity of the space-filling curve used in DOT. This greatly reduces the number of space transformation operations. We then propose a novel spatial join algorithm based on this range query processing algorithm. In processing a spatial join, we determine the access order of disk pages so that we can minimize the number of disk accesses. We show the superiority of the proposed method by extensive experiments using data sets of various distributions and sizes. The experimental results reveal that the proposed method improves the performance of spatial join processing up to three times in comparison with the widely-used R-tree-based spatial join method.

downloadDownload free PDFView PDFchevron_rightEfficient join-index-based spatial-join processing: A clustering approachChang-Tien Lu

2002

A join-index is a data structure used for processing join queries in databases. Join-indices use precomputation techniques to speed up online query processing and are useful for data sets which are updated infrequently. The I/O cost of join computation using a join-index with limited buffer space depends primarily on the page-access sequence used to fetch the pages of the base relations. Given a join-index, we introduce a suite of methods based on clustering to compute the joins. We derive upper bounds on the length of the page-access sequences. Experimental results with Sequoia 2000 data sets show that the clustering method outperforms existing methods based on sorting and online-clustering heuristics.

downloadDownload free PDFView PDFchevron_rightThe design and implementation of seeded trees: an efficient method for spatial joinsML Lo

IEEE Transactions on Knowledge and Data Engineering, 1998

Existing methods for spatial joins require pre-existing spatial indices or other precomputation, but such approaches are inefficient and limited in generality. Operand data sets of spatial joins may not all have precomputed indices, particularly when they are dynamically generated by other selection or join operations. Also, existing spatial indices are mostly designed for spatial selections, and are not always efficient for joins. This paper explores the design and implementation of seeded trees [1], which are effective for spatial joins and efficient to construct at join time. Seeded trees are R-tree-like structures, but divided into seed levels and grown levels. This structure facilitates using information regarding the join to accelerate the join process, and allows efficient buffer management. In addition to the basic structure and behavior of seeded trees, we present techniques for efficient seeded tree construction, a new buffer management strategy to lower I/O costs, and theoretical analysis for choosing algorithmic parameters. We also present methods for reducing space requirements and improving the stability of seeded tree performance with no additional I/O costs. Our performance studies show that the seeded tree method outperforms other tree-based methods by far both in terms of the number disk pages accessed and weighted I/O costs. Further, its performance gain is stable across different input data, and its incurred CPU penalties are also lower.

downloadDownload free PDFView PDFchevron_rightCascaded spatial join algorithms with spatially sorted outputWalid Aref

Proceedings of the fourth ACM workshop on Advances in geographic information systems - GIS '96, 1996

The spatial join is an operation that combines entities from two spatial data sets into a single entity whenever the combination satisfies the spatial join condition (e.g., if they overlap in space).

downloadDownload free PDFView PDFchevron_rightA Rule-Based Optimizer for Spatial Join AlgorithmsJoao Comba

2008

Abstract. The spatial join operation is both one of the most important and expensive operations in Geographic Database Management Systems (GDBMS). This paper presents a set of rules to optimize the performance of the filtering step of spatial joins operations. First, a set of expressions to predict the number of I/O operations and CPU performance is presented. The rules are based on expressions to predict the performance of algorithms and tests performed with synthetic and real data sets.

downloadDownload free PDFView PDFchevron_rightTOUCH: In-Memory Spatial Join by Hierarchical Data-Oriented PartitioningPanagiotis Karras

2013

Efficient spatial joins are pivotal for many applications and particularly important for geographical information systems or for the simulation sciences where scientists work with spatial models. Past research has primarily focused on diskbased spatial joins; efficient in-memory approaches, however, are important for two reasons: a) main memory has grown so large that many datasets fit in it and b) the inmemory join is a very time-consuming part of all disk-based spatial joins. In this paper we develop TOUCH, a novel in-memory spatial join algorithm that uses hierarchical data-oriented space partitioning, thereby keeping both its memory footprint and the number of comparisons low. Our results show that TOUCH outperforms known in-memory spatial-join algorithms as well as in-memory implementations of disk-based join approaches. In particular, it has a one order of magnitude advantage over the memory-demanding state of the art in terms of number of comparisons (i.e., pairwise object co...

downloadDownload free PDFView PDFchevron_rightApproximate Processing of Multiway Spatial Joins in Very Large DatabasesDinos Arkoumanis

Lecture Notes in Computer Science, 2002

Existing work on multiway spatial joins focuses on the retrieval of all exact solutions with no time limit for query processing. Depending on the query and data properties, however, exhaustive processing of multiway spatial joins can be prohibitively expensive due to the exponential nature of the problem. Furthermore, if there do not exist any exact solutions, the result will be empty even though there may exist solutions that match the query very closely. These shortcomings motivate the current work, which aims at the retrieval of the best possible (exact or approximate) solutions within a time threshold, since fast retrieval of approximate matches is the only way to deal with the ever increasing amounts of multimedia information in several real time systems. We propose various techniques that combine local and evolutionary search with underlying indexes to prune the search space. In addition to their usefulness as standalone methods for approximate query processing, the techniques can be combined with systematic search to enhance performance when the goal is retrieval of the best solutions.

downloadDownload free PDFView PDFchevron_rightSpatial Joins Using R-trees: Breadth-First Traversal with Global OptimizationsElke Rundensteiner

Very Large Data Bases, 1997

R-tree based spatial join is useful because of both its superior performance and the wide spread implementation of R-trees. We present a new R-tree join method called BFRJ (Breadth-First R-tree Join). BFRJ syn- chronously traverses both R-trees in breadth- first order while processing join computation one level at a time. At each level, BFRJ creates an intermediate join index and

downloadDownload free PDFView PDFchevron_rightkeyboard_arrow_downView more papers

Related topics

IconographyaddFollow

Ancient Near EastaddFollow

Ritual TheoryaddFollow

Archaeology of Ritual and MagicaddFollow

Ancient Mesopotamian ReligionsaddFollow

Archaeology of RitualaddFollow

Magic and Divination in the Anci...addFollow

Ancient magicaddFollow

Iconography and IconologyaddFollow

Talismans and AmuletsaddFollow

Religious and Magical PracticesaddFollow

Angels and DemonsaddFollow

• Explore
• Papers
• Topics

• Features
• Mentions
• Analytics
• PDF Packages
• Advanced Search
• Search Alerts

• Journals
• Academia.edu Journals
• My submissions
• Reviewer Hub
• Why publish with us
• Testimonials

• Company
• About
• Careers
• Press
• Help Center
• Terms
• Privacy
• Copyright
• Content Policy

580 California St., Suite 400San Francisco, CA, 94104© 2026 Academia. All rights reserved