Abstract Proximity Search in Databases (2008)
Roy Goldman, Narayanan Shivakumar, Suresh Venkatasubramanian, Hector Garcia-molina
An information retrieval (IR) engine can rank documents based on textual proximity of key-words within each document. In this paper we apply this notion to search across an entire database for...
Orkut Buyukkokten, Luis Gravano, Junghoo Cho, Hector Garcia-molina, Narayanan Shivakumar
Many information resources on the web are relevant primarily to limited geographical communities. For instance, web sites containing information on restaurants, theaters, and apartment rentals are...
Orkut Buyukkokten, Luis Gravano, Junghoo Cho, Hector Garcia-molina, Narayanan Shivakumar
Many information resources on the web are relevant primarily to limited geographical communities. For instance, web sites containing information on restaurants, theaters, and apartment rentals are...
Multi-Way Partitioning of VLSI Circuits (2008)
Prathima Agrawal, B. Narendran, Narayanan Shivakumar
Partitioning is one of the critical phases of hierarchical design processes like VLSI design. Good partitioning techniques can positively influence the performance and cost of a VLSI product. This...
Crawler-Friendly Web Servers (2007)
Onn Br, Junghoo Cho, Hector Garcia-molina, Narayanan Shivakumar
In this paper we study how to make web servers (e.g., Apache) more crawler friendly. Current web servers offer the same interface to crawlers and regular web surfers, even though crawlers and surfers...
Abstract Finding near-replicas of documents on the web (2007)
Narayanan Shivakumar, Hector Garcia-molina
We consider how to e ciently compute the overlap between all pairs of web documents. This information can be used to improve web crawlers, web archivers and in the presentation of search results,...
Orkut Buyukkokten, Luis Gravano, Junghoo Cho, Hector Garcia-molina, Narayanan Shivakumar
Many information resources on the web are relevant primarily to limited geographical communities. For instance, web sites containing information on restaurants, theaters, and apartment rentals are...
Finding replicated web collections (2000)
Junghoo Cho, Narayanan Shivakumar, Hector Garcia-molina
Many web documents (such as JAVA FAQs) are being replicated on the Internet. Often entire document collections (such as hyperlinked Linux manuals) are being replicated many times. In this paper, we...
Computing geographical scopes of web resources (2000)
Junyan Ding, Luis Gravano, Narayanan Shivakumar
Many information resources on the web are relevant primarily to limited geographical communities. For instance, web sites containing information on restaurants, theaters, and apartment rentals are...
Finding replicated web collections (2000)
Junghoo Cho, Narayanan Shivakumar, Hector Garcia-molina
Paper Number 201 Many web documents (such as JAVA FAQs) are being replicated on the Internet. Often entire document collections (such as hyperlinked Linux manuals) are being replicated many times. In...
Computing Geographical Scopes of Web Resources (2000)
Junyan Ding, Luis Gravano, Narayanan Shivakumar, Gigabeat Inc
Many information resources on the web are relevant primarily to limited geographical communities. For instance, web sites containing information on restaurants, theaters, and apartment rentals are...
Crawler-Friendly Web Servers (2000)
Onn Brandman, Junghoo Cho, Hector Garcia-molina, Narayanan Shivakumar
In this paper we study how to make web servers #e.g., Apache# morecrawler friendly. Current web servers o#er the same interfacetocrawlers and regular web surfers, even though crawlers and surfers...
Finding Replicated Web Collections (2000)
Junghoo Cho, Narayanan Shivakumar, Hector Garcia-molina
Many web documents (such as JAVA FAQs) are being replicated on the Internet. Often entire document collections (such as hyperlinked Linux manuals) are being replicated many times. In this paper, we...
Computing Geographical Scopes of Web Resources (2000)
Junyan Ding, Narayanan Shivakumar, Luis Gravano
Many information resources on the web are relevant primarily to limited geographical communities. For instance, web sites containing information on restaurants, theaters, and apartment rentals are...
Computing geographical scopes of web resources (2000)
Junyan Ding, Narayanan Shivakumar, Luis Gravano
Many information resources on the web are relevant primarily to limited geographical communities. For instance, web sites containing information on restaurants, theaters, and apartment rentals are...
Detecting digital copyright violations on the internet / (1999)
Submitted to the Department of Computer Science.
Exploiting geographical location information of web pages (1999)
Orkut Buyukkokten, Junghoo Cho, Hector Garcia-molina, Luis Gravano, Narayanan Shivakumar
Many information sources on the web are relevant primarily to specific geographical communities. For instance, web sites containing information on restaurants, theatres and apartment rentals are...
Exploiting Geographical Location Information of Web Pages (1999)
Orkut Buyukkokten, Junghoo Cho, Hector Garcia-molina, Luis Gravano, Narayanan SHivakumar
Many information resources on the web are relevant primarily to limited geographical communities. For instance, web sites containing information on restaurants, theaters, and apartment rentals are...
Exploiting Geographical Location Information of Web Pages (1999)
Orkut Buyukkokten, Junghoo Cho, Hector Garcia-molina, Luis Gravano, Narayanan Shivakumar
Many information sources on the web are relevant primarily to specific geographical communities. For instance, web sites containing information on restaurants, theatres and apartment rentals are...
Computing iceberg queries efficiently (1998)
Min Fang, Narayanan Shivakumar, Hector Garcia-Molina, Rajeev Motwani, Jeffrey D. Ullman
Many applications compute aggregate functions...
Computing iceberg queries efficiently (1998)
Min Fang, Narayanan Shivakumar, Hector Garcia-molina, Rajeev Motwani, Jeffrey D. Ullman
Many applications compute aggregate func-tions over an attribute (or set of attributes) to find aggregate values above some spec-ified threshold. We call such queries ice-berg queries, because the...
Proximity search in databases (1998)
Roy Goldman, Narayanan Shivakumar, Suresh Venkatasubramanian, Hector Garcia-molina
An information retrieval (IR) engine can rank documents based on textual proximityofkeywords within each document. In this paper we apply this notion to search across an entire database for objects...
Computing iceberg queries efficiently (1998)
Min Fang, Narayanan Shivakumar, Hector Garcia-molina, Rajeev Motwani, Jeffrey D. Ullman
Many applications compute aggregate functions (such as COUNT, SUM) over an attribute (or set of attributes) to find aggregate values above some specified threshold. We call such queries iceberg...
Proximity search in databases (1998)
Roy Goldman, Narayanan Shivakumar, Suresh Venkatasubramanian, Hector Garcia-molina
An information retrieval (IR) engine can rank
Computing Iceberg Queries Efficiently (1998)
Min Fang, Narayanan Shivakumar, Hector Garcia-molina, Rajeev Motwani, Jeffrey D. Ullman
Many applications compute aggregate functions over an attribute (or set of attributes) to find aggregate values above some specified threshold. We call such queries iceberg queries, because the...
Safeguarding and Charging for Information on the Internet (1998)
Hector Garcia-molina, Steven P. Ketchpel, Narayanan Shivakumar
With the growing acceptance of the Internet as a new dissemination medium, several new and interesting challenges arise in building a digital commerce infrastructure. In this article we discuss some...
Finding Near-Replicas of Documents on the Web (1998)
Narayanan Shivakumar, Hector Garcia-molina
We consider how to efficiently compute the overlap between all pairs of web documents. This information can be used to improve web crawlers, web archivers and in the presentation of search results,...
Finding Near-Replicas of Documents on the Web (1998)
Narayanan Shivakumar, Hector Garcia-molina
. We consider how to efficiently compute the overlap between all pairs of web documents. This information can be used to improve web crawlers, web archivers and in the presentation of search results,...
Proximity search in databases (1998)
Roy Goldman, Narayanan Shivakumar, Suresh Venkatasubramanian, Hector Garcia-molina
An information retrieval (IR) engine can rank documents based on textual proximityofkeywords within each document. In this paper we apply this notion to search across an entire database for objects...
Safeguarding and charging for information on the internet (1998)
Hector Garcia-molina, Steven P. Ketchpel, Narayanan Shivakumar
With the growing acceptance of the Internet as a new dissemination medium, several new and interesting challenges arise in building a digital commerce infrastructure. In this article we discuss some...
Filtering with approximate predicates (1998)
Narayanan Shivakumar, Hector Garcia-molina, Ra S. Chekuri
Approximate predicates can be used to reduce the number of comparisons made by expensive, complex predicates. For example, to check if a point is within a region (expensive predicate) we can first...
Filtering with Approximate Predicates (1997)
Narayanan Shivakumar, Hector Garcia-molina, Ra S. Chekuri
Approximate predicates can be used to reduce the number of comparisons made by expensive, complex predicates. For example, to check if a point is within a region (expensive predicate) we can first...
Wave-Indices: Indexing Evolving Databases (1997)
Narayanan Shivakumar, Hector Garcia-molina
In many applications, new data is being generated every day. Often an index of the data of a past window of days is required to answer queries efficiently. For example, in a warehouse one may need an...
Narayanan Shivakumar, Jan Jannink, Jennifer Widom
We consider per-user profile replication as a mechanism for faster location lookup of mobile users in a Personal Communications Service system. We present a minimum-cost maximum-flow based algorithm...
Filtering with Approximate Predicates (1997)
Narayanan Shivakumar, Hector Garcia-molina, Chandra S. Chekuri, Ra S. Chekuri
Approximate predicates can be used to reduce the number of comparisons made by expensive, complex predicates. For example, to check if a point is within a region (expensive predicate) we can first...
Efficient and flexible location management techniques for wireless communication systems (1996)
Jan Jannink, Derek Lam, Narayanan Shivakumar, Jennifer Widom, Donald C. Cox
We consider the problem of managing the information required to locate users in a wireless communication system, with a focus on designing and evaluating location management techniques that are...
Energy-efficient indexing for information dissemination in wireless systems (1996)
Narayanan Shivakumar, Suresh Venkatasubramanian
We consider the application of high volume information dissemination in broadcast based mobile environments. Since current mobile units accessing broadcast information have limited battery capacity,...
Efficient and flexible location management techniques for wireless communication systems (1996)
Jan Jannink, Derek Lam, Narayanan Shivakumar, Jennifer Widom, Donald C. Cox
We consider the problem of managing the information required to locate users in a wireless communication system, with a focus on designing and evaluating location management techniques that are...
dSCAM: Finding Document Copies across Multiple Databases (1996)
Hector Garcia-Molina, Luis Gravano, Narayanan Shivakumar
The advent of the Internet has made the illegal dissemination of copyrighted material easy. An important problem is how to automatically detect when a "new" digital document is...
Building a Scalable and Accurate Copy Detection Mechanism (1996)
Narayanan Shivakumar, Hector Garcia-molina
Often, publishers are reluctant to offer valuable digital documents on the Internet for fear that they will be re-transmitted or copied widely. A Copy Detection Mechanism can help identify such...
dSCAM: Finding Document Copies across Multiple Databases (1996)
Hector Garcia-Molina, Luis Gravano, Narayanan Shivakumar
The advent of the Internet has made the illegal dissemination of copyrighted material easy. An important problem is how to automatically detect when a "new" digital document is...
Energy-e cient indexing for information dissemination in wireless systems (1996)
Narayanan Shivakumar, Suresh Venkatasubramanian
We consider the application of high volume information dissemination in broadcast based mobile en-vironments. Since current mobile units accessing broadcast information have limited battery capacity,...
Data Management for User Profiles in Wireless Communications Systems (1995)
Jan Jannink, Derek Lam, Narayanan Shivakumar, Jennifer Widom, Donald C. Cox
The explosive growth in wireless communications systems and the demand for advanced mobility features have created novel data management problems. Current schemes to address these problems rely on...
User Profile Replication for Faster Location Lookup in Mobile Environments (1995)
Narayanan Shivakumar, Jennifer Widom
We consider per-user profile replication as a mechanism for faster location lookup of mobile users in a Personal Communications Service system. We present a minimum-cost maximum-flow based algorithm...
SCAM: A Copy Detection Mechanism for Digital Documents (1995)
Narayanan Shivakumar, Hector Garcia-molina
Copy detection in Digital Libraries may provide the necessary guarantees for publishers and newsfeed services to offer valuable on-line data. We consider the case for a registration server that...
SCAM: A Copy Detection Mechanism for Digital Documents (1995)
Narayanan Shivakumar, Hector Garcia-molina
Copy detection in Digital Libraries may provide the necessary guarantees for publishers and newsfeed services to offer valuable on-line data. We consider the case for a registration server that...
The SCAM Approach to Copy Detection in Digital Libraries (1995)
Narayanan Shivakumar, Hector Garcia-molina
this article, we will give a brief overview of some proposed mechanisms that address each of the problems illustrated by the above two scenarios. In Copy Guarantees for Digital Publishers , we...
SCAM: A Copy Detection Mechanism for Digital Documents (1995)
Narayanan Shivakumar, Hector Garcia-molina
Copy detection in Digital Libraries may provide the necessary guarantees for publishers and newsfeed services to o er valuable on-line data. We consider the case for a registration server that...
Multi-Way VLSI Circuit Partitioning Based on Dual Net Representation (1994)
Jason Cong, Wilburt Labio, Narayanan Shivakumar
In this paper, we study the area-balanced multi-way partitioning problem of VLSI circuits based on a new dual netlist representation named the hybrid dual netlist (HDN), and propose a general...
Multi-Way VLSI Circuit Partitioning Based on Dual Net Representation (1994)
Jason Cong, Wilburt Labio, Narayanan Shivakumar
In this paper, we study the area-balanced multi-way partitioning problem of VLSI circuits based on a new dual netlist representation named the hybrid dual netlist (HDN), and propose a general...
Multi-Way VLSI Circuit Partitioning Based on Dual Net Representation (1994)
Jason Cong, Wilburt Labio, Narayanan Shivakumar
In this paper, we study the area-balanced multi-way partitioning problem of VLSI circuits based on a new dual netlist representation named the hybrid dual netlist (HDN), and propose a general...
Multi-Way VLSI Circuit Partitioning Based on Dual Net Representation (1994)
Jason Cong, Wilburt Labio, Narayanan Shivakumar
In this paper, we study the area-balanced multi-way partitioning problem of VLSI circuits based on a new dual netlist representation named the hybrid dual netlist (HDN). Given a netlist, we first...
Multi-Way VLSI Circuit Partitioning Based on Dual Net Representation (1994)
Jason Cong Wilburt, Jason Cong, Wilburt Labio, Narayanan Shivakumar
In this paper, we study the area-balanced multi-way partitioning problem of VLSI circuits based on a new dual netlist representation named the hybrid dual netlist (HDN). Given a netlist, we first...
Multi-Way VLSI Circuit Partitioning Based on Dual Net Representation (1994)
Jason Cong, Wilburt Labio, Narayanan Shivakumar
In this paper, we study the area-balanced multi-way partitioning problem of VLSI circuits based on a new dual netlist representation named the hybrid dual netlist (HDN), and propose a general...