Pages that link to "Item:Q2790121"

The following pages link to ACM Transactions on Database Systems (Q2790121):

Displaying 50 items.

• Optimality of Clustering Properties of Space-Filling Curves (Q2790122) (← links)
• Sharing across Multiple MapReduce Jobs (Q2790127) (← links)
• Efficient Algorithms and Cost Models for Reverse Spatial-Keyword <i>k</i> -Nearest Neighbor Search (Q2790129) (← links)
• Domination in the Probabilistic World (Q2790131) (← links)
• On the Complexity of Query Result Diversification (Q2790132) (← links)
• Distributed Geometric Query Monitoring Using Prediction Models (Q2790135) (← links)
• Robust Distributed Query Processing for Streaming Data (Q2790136) (← links)
• Optimizing XML querying using type-based document projection (Q2943524) (← links)
• A graph-theoretic approach to map conceptual designs to XML schemas (Q2943526) (← links)
• Moving spatial keyword queries (Q2943529) (← links)
• Analysis and optimization for boolean expression indexing (Q2943530) (← links)
• A partition-based method for string similarity joins with edit-distance constraints (Q2943532) (← links)
• Top-k diversity queries over bounded regions (Q2943536) (← links)
• Revisiting “forward node-selecting queries over trees” (Q2943537) (← links)
• Algebraic incremental maintenance of XML views (Q2943541) (← links)
• Almost-linear inclusion for XML regular expression types (Q2943542) (← links)
• Asymmetric signature schemes for efficient exact edit similarity query processing (Q2943545) (← links)
• Incremental graph pattern matching (Q2943546) (← links)
• High-performance complex event processing over hierarchical data (Q2943548) (← links)
• Consistent thinning of large geographical data for map visualization (Q2943553) (← links)
• The complexity of regular expressions and property paths in SPARQL (Q2943554) (← links)
• Static analysis and optimization of semantic web queries (Q2943555) (← links)
• Mergeable summaries (Q2943556) (← links)
• Validating XML documents in the streaming model with external memory (Q2943557) (← links)
• Learning schema mappings (Q2943558) (← links)
• Classification of annotation semirings over containment of conjunctive queries (Q2943559) (← links)
• Indexing for summary queries (Q2943560) (← links)
• Pufferfish (Q2943562) (← links)
• Strong simulation (Q2943564) (← links)
• Oblivious bounds on the probability of boolean functions (Q2943565) (← links)
• Mining order-preserving submatrices from probabilistic matrices (Q2943568) (← links)
• Extending string similarity join to tolerant fuzzy token matching (Q2943569) (← links)
• Deletion without rebalancing in multiway search trees (Q2943570) (← links)
• Efficient range searching for categorical and plain data (Q2943571) (← links)
• Organization of clustered files for consecutive retrieval (Q3219806) (← links)
• Analysis of new variants of coalesced hashing (Q3219807) (← links)
• Shadowed management of free disk pages with a linked list (Q3313314) (← links)
• Partial-match retrieval using hashing and descriptors (Q3313316) (← links)
• Correctness of query execution strategies in distributed databases (Q3313317) (← links)
• Multiversion concurrency control—theory and algorithms (Q3313318) (← links)
• Maximal objects and the semantics of universal relation databases (Q3321499) (← links)
• A foundation of CODD's relational maybe-operations (Q3323314) (← links)
• Algorithms for trie compaction (Q3330555) (← links)
• Implications of certain assumptions in database performance evauation (Q3330556) (← links)
• Database states and their tableaux (Q3330557) (← links)
• An extension of conflict-free multivalued dependency sets (Q3330558) (← links)
• A clustered search algorithm incorporating arbitrary term dependencies (Q3336742) (← links)
• Practical data-swapping: the first steps (Q3339323) (← links)
• On Concurrency Control by Multiple Versions (Q3339325) (← links)
• Multilevel atomicity—a new correctness criterion for database concurrency control (Q3340199) (← links)