Остановите войну!
for scientists:
default search action
Sridhar Ramaswamy
- > Home > Persons > Sridhar Ramaswamy
Publications
- 2000
- [c18]Lars Arge, Octavian Procopiuc, Sridhar Ramaswamy, Torsten Suel, Jan Vahrenhold, Jeffrey Scott Vitter:
A Unified Approach for Indexed and Non-Indexed Spatial Joins. EDBT 2000: 413-429 - [c17]Sridhar Ramaswamy, Rajeev Rastogi, Kyuseok Shim:
Efficient Algorithms for Mining Outliers from Large Data Sets. SIGMOD Conference 2000: 427-438 - 1999
- [c15]Swarup Acharya, Viswanath Poosala, Sridhar Ramaswamy:
Selectivity Estimation in Spatial Databases. SIGMOD Conference 1999: 13-24 - [c14]Swarup Acharya, Phillip B. Gibbons, Viswanath Poosala, Sridhar Ramaswamy:
Join Synopses for Approximate Query Answering. SIGMOD Conference 1999: 275-286 - [c13]Minos N. Garofalakis, Sridhar Ramaswamy, Rajeev Rastogi, Kyuseok Shim:
Of Crawlers, Portals, Mice and Men: Is there more to Mining the Web? (Panel). SIGMOD Conference 1999: 504 - [c12]Swarup Acharya, Phillip B. Gibbons, Viswanath Poosala, Sridhar Ramaswamy:
The Aqua Approximate Query Answering System. SIGMOD Conference 1999: 574-576 - 1998
- [c11]Gabriel M. Kuper, Sridhar Ramaswamy, Kyuseok Shim, Jianwen Su:
A Constraint-Based Spatial Extension to SQL. ACM-GIS 1998: 112-117 - [c10]Banu Özden, Sridhar Ramaswamy, Abraham Silberschatz:
Cyclic Association Rules. ICDE 1998: 412-421 - [c9]Lars Arge, Octavian Procopiuc, Sridhar Ramaswamy, Torsten Suel, Jeffrey Scott Vitter:
Theory and Practice of I/O-Efficient Algorithms for Multidimensional Batched Searching Problems (Extended Abstract). SODA 1998: 685-694 - [c8]Sridhar Ramaswamy, Sameer Mahajan, Abraham Silberschatz:
On the Discovery of Interesting Patterns in Association Rules. VLDB 1998: 368-379 - [c7]Lars Arge, Octavian Procopiuc, Sridhar Ramaswamy, Torsten Suel, Jeffrey Scott Vitter:
Scalable Sweeping-Based Spatial Join. VLDB 1998: 570-581 - 1996
- [j2]Paris C. Kanellakis, Sridhar Ramaswamy, Darren Erik Vengroff, Jeffrey Scott Vitter:
Indexing for Data Models with Constraints and Classes. J. Comput. Syst. Sci. 52(3): 589-612 (1996) - 1995
- [j1]Serge Abiteboul, Paris C. Kanellakis, Sridhar Ramaswamy, Emmanuel Waller:
Method Schemas. J. Comput. Syst. Sci. 51(3): 433-455 (1995) - [c5]Sridhar Ramaswamy, Paris C. Kanellakis:
OODB Indexing by Class-Division. SIGMOD Conference 1995: 139-150 - [c4]Sairam Subramanian, Sridhar Ramaswamy:
The P-range Tree: A New Data Structure for Range Searching in Secondary Memory. SODA 1995: 378-387 - 1994
- [c3]Sridhar Ramaswamy, Sairam Subramanian:
Path Caching: A Technique for Optimal External Searching. PODS 1994: 25-35 - 1993
- [c2]Gerd G. Hillebrand, Paris C. Kanellakis, Sridhar Ramaswamy:
Functional Programming Formalisms for OODBMS Methods. NATO ASI OODBS 1993: 73-99 - [c1]Paris C. Kanellakis, Sridhar Ramaswamy, Darren Erik Vengroff, Jeffrey Scott Vitter:
Indexing for Data Models with Constraints and Classes. PODS 1993: 233-243 - 1992
- [p1]Marian H. Nodine, Sridhar Ramaswamy, Stanley B. Zdonik:
A Cooperative Transaction Model for Design Databases. Database Transaction Models for Advanced Applications 1992: 53-85
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-09-27 22:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint