Sciweavers

11212 search results - page 661 / 2243
» Semi-persistent Data Structures
Sort
View
ICDT
2007
ACM
133views Database» more  ICDT 2007»
16 years 1 months ago
XML Schema Mappings in the Presence of Key Constraints and Value Dependencies
Abstract. Schema mappings play a central role in both data integration and data exchange, and are understood as high-level specifications describing the relationships between data...
Tadeusz Pankowski, Jolanta Cybulka, Adam Meissner
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
15 years 11 months ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh
EDBT
2010
ACM
210views Database» more  EDBT 2010»
15 years 9 months ago
Keyword search for data-centric XML collections with long text fields
Users who are unfamiliar with database query languages can search XML data sets using keyword queries. Current approaches for supporting such queries are either for textcentric XM...
Arash Termehchy, Marianne Winslett
BXML
2003
15 years 8 months ago
Rule-Based Generation of XML Schemas from UML Class Diagrams
We present an approach of how to automatically extract an XML document structure from a conceptual data model that describes the content of the document. We use UML class diagrams ...
Tobias Krumbein, Thomas Kudrass
CORR
2010
Springer
249views Education» more  CORR 2010»
15 years 7 months ago
Lower Bounds on Near Neighbor Search via Metric Expansion
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
Rina Panigrahy, Kunal Talwar, Udi Wieder